Convergence Properties of the Regularized Newton Method for the Unconstrained Nonconvex Optimization
- Kyoto University, Department of Applied Mathematics and Physics, Graduate School of Informatics (Japan)
The regularized Newton method (RNM) is one of the efficient solution methods for the unconstrained convex optimization. It is well-known that the RNM has good convergence properties as compared to the steepest descent method and the pure Newton's method. For example, Li, Fukushima, Qi and Yamashita showed that the RNM has a quadratic rate of convergence under the local error bound condition. Recently, Polyak showed that the global complexity bound of the RNM, which is the first iteration k such that -parallel {nabla}f(x{sub k})-parallel {<=}{epsilon}, is O({epsilon}{sup -4}), where f is the objective function and {epsilon} is a given positive constant. In this paper, we consider a RNM extended to the unconstrained 'nonconvex' optimization. We show that the extended RNM (E-RNM) has the following properties. (a) The E-RNM has a global convergence property under appropriate conditions. (b) The global complexity bound of the E-RNM is O({epsilon}{sup -2}) if {nabla}{sup 2}f is Lipschitz continuous on a certain compact set. (c) The E-RNM has a superlinear rate of convergence under the local error bound condition.
- OSTI ID:
- 21480262
- Journal Information:
- Applied Mathematics and Optimization, Vol. 62, Issue 1; Other Information: DOI: 10.1007/s00245-009-9094-9; Copyright (c) 2010 Springer Science+Business Media, LLC; ISSN 0095-4616
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Regularization Newton Method for Solving Nonlinear Complementarity Problems
A parallel gradient distribution algorithm for large-scale optimization