An augmented Lagrangian algorithm for constrained nonlinear least-squares
arXiv:2607.11239
The paper proposes an algorithm that solves nonlinear least‑squares problems with mixed nonlinear and linear constraints by using an augmented Lagrangian formulation together with a gradient‑projection technique, and demonstrates global convergence and numerical performance.
Abstract
We present an algorithm for solving nonlinear least-squares problems subject to a mix of nonlinear and linear constraints. The nonlinear constraints are handled by reformulating the objective as the augmented Lagrangian function while linear constraints are handled directly. Each iteration consists of approximately solving a linearly constrained problem by means of a gradient projection technique. Our approach also involves a structured approximation of the augmented Lagrangian Hessian. We show global convergence of the method and assess the performance through numerical experiments.