Global complexity bound of the Levenberg–Marquardt method
From MaRDI portal
Publication:2829563
DOI10.1080/10556788.2016.1179737zbMath1406.65037OpenAlexW2346412421MaRDI QIDQ2829563
Publication date: 8 November 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1179737
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Related Items (13)
A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients ⋮ Global complexity bound of the inexact Levenberg-Marquardt method ⋮ A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results ⋮ Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems ⋮ Newton-MR: inexact Newton method with minimum residual sub-problem solver ⋮ On the complexity of a stochastic Levenberg-Marquardt method ⋮ Stochastic regularized Newton methods for nonlinear equations ⋮ A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations ⋮ Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares ⋮ A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares ⋮ On a new updating rule of the Levenberg-Marquardt parameter ⋮ A brief survey of methods for solving nonlinear least-squares problems ⋮ Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations
Cites Work
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- On a global complexity bound of the Levenberg-marquardt method
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- A note on the Levenberg-Marquardt parameter
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- An inexact Levenberg-Marquardt method for large sparse nonlinear least squres
- Nonlinear least squares — the Levenberg algorithm revisited
- Modified Gauss–Newton scheme with worst case guarantees for global performance
This page was built for publication: Global complexity bound of the Levenberg–Marquardt method
