Economics at your fingertips  

Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares

Naoki Marumo (), Takayuki Okuno and Akiko Takeda
Additional contact information
Naoki Marumo: University of Tokyo
Takayuki Okuno: Seikei University
Akiko Takeda: University of Tokyo

Computational Optimization and Applications, 2023, vol. 84, issue 3, No 6, 833-874

Abstract: Abstract A new Levenberg–Marquardt (LM) method for solving nonlinear least squares problems with convex constraints is described. Various versions of the LM method have been proposed, their main differences being in the choice of a damping parameter. In this paper, we propose a new rule for updating the parameter so as to achieve both global and local convergence even under the presence of a convex constraint set. The key to our results is a new perspective of the LM method from majorization-minimization methods. Specifically, we show that if the damping parameter is set in a specific way, the objective function of the standard subproblem in LM methods becomes an upper bound on the original objective function under certain standard assumptions. Our method solves a sequence of the subproblems approximately using an (accelerated) projected gradient method. It finds an $$\varepsilon$$ ε -stationary point after $$O(\varepsilon ^{-2})$$ O ( ε - 2 ) computation and achieves local quadratic convergence for zero-residual problems under a local error bound condition. Numerical results on compressed sensing and matrix factorization show that our method converges faster in many cases than existing methods.

Keywords: Nonconvex optimization; Constrained optimization; Nonlinear least squares; Levenberg–Marquardt method; Iteration complexity; Local quadratic convergence (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations: Track citations by RSS feed

Downloads: (external link) Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

Ordering information: This journal article can be ordered from

DOI: 10.1007/s10589-022-00447-y

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Page updated 2023-03-24
Handle: RePEc:spr:coopap:v:84:y:2023:i:3:d:10.1007_s10589-022-00447-y