On a Global Complexity Bound of the Levenberg-Marquardt Method

Journal of Optimization Theory and Applications

Volumn 147, Issue 3, 2010, Pages 443-453

  Ueda, Kenji ^a   Yamashita, Nobuo ^b  

^a MITSUBISHI ELECTRIC CORPORATION   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

Global complexity bound; Levenberg Marquardt methods; Scale parameter

Indexed keywords

LEAST SQUARES APPROXIMATIONS;

APPROXIMATE SOLUTION; DOUBLE PIPES; GLOBAL COMPLEXITY BOUNDS; LEVENBERG-MARQUARDT METHOD; NONLINEAR LEAST SQUARE PROBLEM; NUMBER OF ITERATIONS; SCALE PARAMETER; UNCONSTRAINED MINIMIZATION; UPPER BOUND;

ITERATIVE METHODS;

EID: 78049387733     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-010-9731-0     Document Type: Article

References (16)

1. Bertsekas, D. P.: Nonlinear Programming. Athena Scientific, New York (1995).
2. Moré, J. J.: The Levenberg-Marquardt algorithm: implementation and theory. Numer. Anal. 630, 105-116 (1978).
3. Nocedal, J., Wright, S. J.: Numerical Optimization, 2nd edn. Springer, New York (2006).
4. Osborne, M. R.: Nonlinear least squares-the Levenberg algorithm revisited. J. Aust. Math. Soc. 19, 343-357 (1976).
5. Wright, S. J., Holt, J. N.: An inexact Levenberg-Marquardt method for large sparse nonlinear least squares. J. Aust. Math. Soc. 26, 387-403 (1985).
6. Conn, A. R., Gould, N. I. M., Toint, P. L.: Trust-Region Methods. SIAM, Philadelphia (2000).
7. Cartis, C., Gould, N. I. M., Toint, P. L.: Adaptive cubic regularization methods for unconstrained optimization. Part II: Worst-case function- and derivative-evaluation complexity. Math. Program. doi: 10. 1007/s10107-009-0337-y.
8. Cartis, C., Gould, N. I. M., Toint, P. L.: On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems. Technical Report 09/14, Department of Mathematics, FUNDP-University of Namur (2009).
9. Gratton, S., Sartenaer, A., Toint, P. L.: Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 19, 414-444 (2008).
10. Nesterov, Yu.: Introductory Lectures on Convex Optimization. Kluwer Academic, Dordrecht (2004).
11. Nesterov, Yu., Polyak, B. T.: Cubic regularization of Newton method and its global performance. Math. Program., Ser. A 108, 177-205 (2006).
12. Polyak, R. A.: Regularized Newton method for unconstrained convex optimization. Math. Program., Ser. B 120, 125-145 (2009).
13. Ueda, K., Yamashita, N.: Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization. Appl. Math. Optim. 62, 27-46 (2010).
14. Ueda, K., Yamashita, N.: A regularized Newton method without line search for unconstrained optimization. Technical Report 2009-007, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University (2009).
15. Nesterov, Yu.: Modified Gauss-Newton scheme with worst-case guarantees for global performance. Optim. Methods Softw. 22, 469-483 (2007).
16. Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg-Marquardt method. Comput., Suppl. (Wien) 15, 227-238 (2001).