Interior point algorithms for nonlinear constrained least squares problems

14Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

We consider Nonlinear Least Squares problems with equality and inequality constraints and propose a numerical technique that integrates methods for unconstrained problems, based on Gauss-Newton algorithm, with FAIPA, the Feasible Arc Interior Point Algorithm for constrained optimization. We also present some numerical results on test problems available in the literature and compare them with the quasi-Newton version of FAIPA. We also describe an application to the identification of mechanical parameters of composite materials. The present algorithms are globally convergent, very robust and efficient.

Cite

CITATION STYLE

APA

Herskovits, J., Dubeux, V., Mota Soares, C. M., & Araújo, A. L. (2004). Interior point algorithms for nonlinear constrained least squares problems. In Inverse Problems in Science and Engineering (Vol. 12, pp. 211–223). Taylor and Francis Inc. https://doi.org/10.1080/10682760310001598698

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free