Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem
- 8 September 2011
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 152 (2) , 450-467
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexityMathematical Programming, 2010
- The quadratic convergence of a smoothing Levenberg–Marquardt method for nonlinear complementarity problemApplied Mathematics and Computation, 2008
- Recursive Trust-Region Methods for Multiscale Nonlinear OptimizationSIAM Journal on Optimization, 2008
- A globally convergent Levenberg–Marquardt method for solving nonlinear complementarity problemApplied Mathematics and Computation, 2007
- Regularized Newton method for unconstrained convex optimizationMathematical Programming, 2007
- Accelerating the cubic regularization of Newton’s method on convex problemsMathematical Programming, 2007
- Cubic regularization of Newton method and its global performanceMathematical Programming, 2006
- A special newton-type optimization methodOptimization, 1992
- The Levenberg-Marquardt algorithm: Implementation and theory1978
- Nonlinear least squares — the Levenberg algorithm revisitedThe Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1976