Optimization Online


A local convergence property of primal-dual methods for nonlinear programming

Paul Armand (paul.armand***at***unilim.fr)
JoŽl Benoist (joel.benoist***at***unilim.fr)

Abstract: We prove a new local convergence property of a primal-dual method for solving nonlinear optimization problem. Following a standard interior point approach, the complementarity conditions of the original primal-dual system are perturbed by a parameter which is driven to zero during the iterations. The sequence of iterates is generated by a linearization of the perturbed system and by applying the fraction to the boundary rule to maintain strict feasibility of the iterates with respect to the nonnegativity constraints. The analysis of the rate of convergence is carried out by considering a linear or a superlinear arbitrary decreasing sequence of perturbation parameters. We show that, if the perturbation parameters converge to zero linearly or superlinearly and once an iterate belongs to a neighborhood of convergence of the Newton method applied to the original system, then the whole sequence of iterates converges and asymptotically follows the central trajectory in a natural way.

Keywords: constrained optimization, interior point methods, nonlinear programming, primal-dual methods, barrier methods

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Report 2006-05, Dťpartement DMI, Laboratoire XLIM - UMR CNRS 6172, 123, avenue Albert Thomas, 87060 Limoges, FRANCE, January 2006

Download: [PDF]

Entry Submitted: 02/07/2006
Entry Accepted: 02/07/2006
Entry Last Modified: 02/08/2006

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society