The Levenberg–Marquardt method: an overview of modern convergence theories and more

A Fischer, AF Izmailov, MV Solodov - Computational Optimization and …, 2024 - Springer
Abstract The Levenberg–Marquardt method is a fundamental regularization technique for
the Newton method applied to nonlinear equations, possibly constrained, and possibly with …

A modified inexact Levenberg–Marquardt method with the descent property for solving nonlinear equations

J Yin, J Jian, G Ma - Computational Optimization and Applications, 2024 - Springer
In this work, we propose a modified inexact Levenberg–Marquardt method with the descent
property for solving nonlinear equations. A novel feature of the proposed method is that one …

Reconstruction of an acoustically sound-soft obstacle from one incident field and the far-field pattern

T Johansson, BD Sleeman - IMA Journal of Applied Mathematics, 2007 - academic.oup.com
The problem considered is that of determining the shape of a plane acoustically sound-soft
obstacle from the knowledge of the far-field pattern for one time-harmonic incident field. An …

Behavior of Newton-type methods near critical solutions of nonlinear equations with semismooth derivatives

A Fischer, AF Izmailov, M Jelitte - Journal of Optimization Theory and …, 2023 - Springer
Having in mind singular solutions of smooth reformulations of complementarity problems,
arising unavoidably when the solution in question violates strict complementarity, we study …

A unified local convergence analysis of inexact constrained Levenberg–Marquardt methods

R Behling, A Fischer - Optimization Letters, 2012 - Springer
Abstract The Levenberg–Marquardt method is a regularized Gauss–Newton method for
solving systems of nonlinear equations. If an error bound condition holds it is known that …

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

N Marumo, T Okuno, A Takeda - Computational Optimization and …, 2023 - Springer
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 …

On the local convergence of the semismooth Newton method for composite optimization

J Hu, T Tian, S Pan, Z Wen - arxiv preprint arxiv:2211.01127, 2022 - arxiv.org
In this paper, we consider a large class of nonlinear equations derived from first-order type
methods for solving composite optimization problems. Traditional approaches to …

The effect of calmness on the solution set of systems of nonlinear equations

R Behling, A Iusem - Mathematical Programming, 2013 - Springer
We address the problem of solving a continuously differentiable nonlinear system of
equations under the condition of calmness. This property, also called upper Lipschitz …

A Levenberg-Marquardt method with approximate projections

R Behling, A Fischer, M Herrich, A Iusem… - Computational …, 2014 - Springer
Abstract The projected Levenberg-Marquardt method for the solution of a system of
equations with convex constraints is known to converge locally quadratically to a possibly …

On the inexactness level of robust Levenberg–Marquardt methods

A Fischer, PK Shukla, M Wang - Optimization, 2010 - Taylor & Francis
Recently, the Levenberg–Marquardt (LM) method has been used for solving systems of
nonlinear equations with nonisolated solutions. Under certain conditions it converges Q …