A primal-dual interior-point algorithm for nonlinear least squares constrained problems

DOI10.1007/BF02578992zbMath1139.90431OpenAlexW2010676273MaRDI QIDQ2568604

Edite M. G. P. Fernandes, M. Fernanda P. Costa

Publication date: 18 October 2005

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02578992

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Interior-point methods (90C51)

Related Items (4)

A regularization method for constrained nonlinear least squares ⋮ Using a spectral scaling structured BFGS method for constrained nonlinear least squares ⋮ Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares ⋮ A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares

Uses Software

• LOQO
• CUTEr

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Test examples for nonlinear programming codes
• Factorized quasi-Newton methods for nonlinear least squares problems
• An interior-point algorithm for nonconvex nonlinear programming
• Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
• Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
• Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
• Some Recent Approaches to Solving Large Residual Nonlinear Least Squares Problems
• An Adaptive Nonlinear Least-Squares Algorithm
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• CUTE
• LOQO:an interior point code for quadratic programming
• An Interior Point Algorithm for Large-Scale Nonlinear Programming
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• A trust region method based on interior point techniques for nonlinear programming.

This page was built for publication: A primal-dual interior-point algorithm for nonlinear least squares constrained problems