Global complexity bound of the inexact Levenberg-Marquardt method

DOI10.1007/s40305-017-0184-0zbMath1413.65243OpenAlexW2773424228MaRDI QIDQ1656193

Jin Yan Fan, Jian Chao Huang

Publication date: 10 August 2018

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-017-0184-0

zbMATH Keywords

nonlinear equationsglobal complexity boundinexact Levenberg-Marquardt method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15)

Related Items (3)

On the complexity of a stochastic Levenberg-Marquardt method ⋮ A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations ⋮ Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Shamanskii-like Levenberg-Marquardt method for nonlinear equations
• 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 the convergence rate of the inexact Levenberg-Marquardt method
• 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
• Global complexity bound of the Levenberg–Marquardt method
• On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
• The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
• Modified Gauss–Newton scheme with worst case guarantees for global performance

This page was built for publication: Global complexity bound of the inexact Levenberg-Marquardt method