On a global complexity bound of the Levenberg-marquardt method
From MaRDI portal
Publication:620432
DOI10.1007/s10957-010-9731-0zbMath1203.90152MaRDI QIDQ620432
Publication date: 19 January 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9731-0
90C60: Abstract computational complexity for mathematical programming problems
90C30: Nonlinear programming
Related Items
The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem, Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem, Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality, Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method, A modified Levenberg-Marquardt method with line search for nonlinear equations, On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization, Global complexity bound of the Levenberg–Marquardt method
Cites Work
- 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 regularized Newton method without line search for unconstrained optimization
- Regularized Newton method for unconstrained convex optimization
- Introductory lectures on convex optimization. A basic course.
- Cubic regularization of Newton method and its global performance
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- An inexact Levenberg-Marquardt method for large sparse nonlinear least squres
- Nonlinear least squares — the Levenberg algorithm revisited
- Trust Region Methods
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- Unnamed Item
- Unnamed Item
- Unnamed Item
