Superlinear convergence of primal-dual interior point algorithms for nonlinear programming

ePubs

The open archive for STFC research publications

Persistent URL	http://purl.org/net/epubs/work/29578
Record Status	Checked
Record Id	29578
Title	Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
Contributors	N I M Gould, D Orban, A Sartenaer, PL Toint
Abstract	The local convergence properties of a class of primal-dual interior point methods are analyzed. These methods are designed to minimize a nonlinear, nonconvex, objective function subject to linear equality constraints and general inequalities. They involve an inner iteration in which the log-barrier merit function is approximately minimized subject to satisfying the linear equality constraints, and an outer iteration that specifies both the decrease in the barrier parameter and the level of accuracy for the inner minimization. It is shown that, asymptotically, for each value of the barrier parameter, solving a single primal-dual linear system is enough to produce an iterate that already matches the barrier subproblem accuracy requirements. The symptotic rate of convergence of the resulting algorithm is Q-superlinear and may be chosen arbitrarily close to quadratic. Furthermore, this rate applies componentwise. These results hold in particular for the method described by Conn, Gould, Orban and Toint, and indicate that the details of its inner minimization are irrelevant in the asymptotics, except for its accuracy requirements.
Organisation	CCLRC
Keywords
Funding Information
Related Research Object(s):
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Report	RAL Technical Reports RAL-TR-2000-014. 2000.		raltr-2000014.pdf	2000