Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Local analysis of Newton-type methods for variational inequalities and nonlinear programming

Local analysis of Newton-type methods for variational inequalities and nonlinear programming This paper presents some new results in the theory of Newton-type methods for variational inequalities, and their application to nonlinear programming. A condition of semistability is shown to ensure the quadratic convergence of Newton's method and the superlinear convergence of some quasi-Newton algorithms, provided the sequence defined by the algorithm exists and converges. A partial extension of these results to nonsmooth functions is given. The second part of the paper considers some particular variational inequalities with unknowns (x, λ), generalizing optimality systems. Here only the question of superlinear convergence of {x k } is considered. Some necessary or sufficient conditions are given. Applied to some quasi-Newton algorithms they allow us to obtain the superlinear convergence of {x k }. Application of the previous results to nonlinear programming allows us to strengthen the known results, the main point being a characterization of the superlinear convergence of {x k } assuming a weak second-order condition without strict complementarity. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Mathematics and Optimization Springer Journals

Local analysis of Newton-type methods for variational inequalities and nonlinear programming

Bonnans, J.
Applied Mathematics and Optimization , Volume 29 (2) – Feb 5, 2005
Download PDF
26 pages

Loading next page...
 
/lp/springer-journals/local-analysis-of-newton-type-methods-for-variational-inequalities-and-OKcqmmGAgs

References (26)

Publisher
Springer Journals
Copyright
Copyright © 1994 by Springer-Verlag New York Inc.
Subject
Mathematics; Calculus of Variations and Optimal Control; Optimization; Systems Theory, Control; Theoretical, Mathematical and Computational Physics; Mathematical Methods in Physics; Numerical and Computational Physics, Simulation
ISSN
0095-4616
eISSN
1432-0606
DOI
10.1007/BF01204181
Publisher site
See Article on Publisher Site

Abstract

This paper presents some new results in the theory of Newton-type methods for variational inequalities, and their application to nonlinear programming. A condition of semistability is shown to ensure the quadratic convergence of Newton's method and the superlinear convergence of some quasi-Newton algorithms, provided the sequence defined by the algorithm exists and converges. A partial extension of these results to nonsmooth functions is given. The second part of the paper considers some particular variational inequalities with unknowns (x, λ), generalizing optimality systems. Here only the question of superlinear convergence of {x k } is considered. Some necessary or sufficient conditions are given. Applied to some quasi-Newton algorithms they allow us to obtain the superlinear convergence of {x k }. Application of the previous results to nonlinear programming allows us to strengthen the known results, the main point being a characterization of the superlinear convergence of {x k } assuming a weak second-order condition without strict complementarity.

Journal

Applied Mathematics and Optimization – Springer Journals

Published: Feb 5, 2005

There are no references for this article.