Superlinear convergence of a Newton-type algorithm for monotone equations

Journal of Optimization Theory and Applications

Volumn 125, Issue 1, 2005, Pages 205-221

  Zhou, G ^a   Toh, K C ^b  

^a CURTIN UNIVERSITY   (Australia)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Convex minimization; Global convergence; Monotone equations; Newton method; Superlinear convergence

Indexed keywords

APPLICATION PROGRAMS; LINEAR PROGRAMMING;

CONDITION; CONVEX MINIMIZATION; FINDING SOLUTIONS; GLOBAL CONVER-GENCE; LOCAL ERROR BOUND; MONOTONE EQUATION; NEWTON'S METHODS; NEWTON-TYPE ALGORITHMS; NONSINGULARITY; SUPERLINEAR CONVERGENCE;

NEWTON-RAPHSON METHOD;

EID: 17444397729     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10957-004-1721-7     Document Type: Article

References (16)

1. SOLODOV M. V., and SVAITER, B. F., A Globally Convergent Inexact Newton Method for System of Monotone Equations, Reformulation: Nonsmooth, Piecewise Smooth, Semisrnooth, and Smoothing Methods, Edited by M. Fukushima and L. Qi, Kluwer Academic Publishers, Dordrecht, Holland, pp. 355-369, 1999.
2. BERTSEKAS, D. P., Nonlinear Programming, Athena Scientific, Belmont, Massachusetts, 199 5.
3. QI, L., and SUN, J., A Nonsmooth Version of Newton's Method, Mathematical Programming, Vol. 58, pp. 353-367, 1993.
4. YAMASHITA, N., and FUKUSHIMA, M., On the Rate of Convergence of the Levenberg-Marquardt Method, Computing, Vol. 15, pp. 239-249, 2001.
5. FISCHER, A., Local Behavior of an Iterative Framework for Generalized Equations with Nonisolated Solutions, Mathematical Programming, Vol. 94, pp. 91-124, 2002.
6. DAN, H., YAMASHITA, N., and FUKUSHIMA, M., A Superlinearly Convergent Algorithm for the Monotone Complementarity Problem without Uniqueness and Nondegeneracy Conditions, Mathematics of Operations Research, Vol. 27, pp. 743-754, 2002.
7. YAMASHITA, N., and FUKUSHIMA, M., The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem, SIAM Journal on Optimization, Vol. 11, pp. 364-379, 2001.
8. KANZOW, C., YAMASHITA, N., and FUKUSHIMA, M., Levenberg-Marquardt Methods for Constrained Nonlinear Equations with Strong Local Convergence Properties, Technical Report 2002-007, Department of Applied Mathematics and Physics, Kyoto University, Kyoto, Japan, 2002.
9. LI, D. H., FUKUSHIMA, M., QI, L., and YAMASHITA, N., Regularized Newton Methods for Convex Minimization Problems with Singular Solutions, Computational Optimization and Applications (to appear).
10. SOLODOV, M. V., A Class of Globally Convergent Algorithms for Pseudomotone Variational Inequalities, Complementarity: Applications, Algorithms, and Extensions, Edited by M. C. Ferris, O. L. Mangasarian, and J. S. Pang, Kluwer Academic Publishers, Dordrecht, Holland, pp. 297-315, 2001.
11. ROBINSON, S. M., Some Continuity Properties of Polyhedral Multifunctions, Mathematical Programming Study, Vol. 14, pp. 206-214, 1981.
12. HORN, R. A., and JOHNSON, C. R., Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
13. MANGASARIAN, O. L., Normal Solutions of Linear Programs, Mathematical Programmming Study, Vol. 22, pp. 206-216, 1984.
14. KANZOW, C., QI, H., and QI, L., On the Minimum-Norm Solution of Linear Programs, Journal of Optimization Theory and Applications, Vol. 116, pp. 333-345, 2003.
15. MANGASARIAN, O. L., A Newton Method for Linear Programming, Data Mining Institute, Technical Report 02-02, 2002.
16. CLARKE, F. H., Optimization and Nonsmooth Analysis, Wiley, New York, NY, 1983.