Local analysis of the feasible primal-dual interior-point method

Authors:
R. Silva;J. Soares;L. N. Vicente
Affiliations:
Departamento de Matemática, Universidade de Coimbra, Coimbra, Portugal 3001-454;Departamento de Matemática, Universidade de Coimbra, Coimbra, Portugal 3001-454;Departamento de Matemática, Universidade de Coimbra, Coimbra, Portugal 3001-454
Venue:
Computational Optimization and Applications
Year:
2008

Citing 10
Cited 0

On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds

Mathematical Programming: Series A and B
On the formulation and theory of the Newton interior-point method for nonlinear programming

Journal of Optimization Theory and Applications
Superlinear and quadratic convergence of some primal—dual interior point methods for constrained optimization

Mathematical Programming: Series A and B
LAPACK Users' guide (third ed.)

LAPACK Users' guide (third ed.)
Local Convergence of the Affine-Scaling Interior-Point Algorithm for Nonlinear Programming

Computational Optimization and Applications
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming

SIAM Journal on Optimization
A Trust-Region Approach to Nonlinear Systems of Equalities and Inequalities

SIAM Journal on Optimization
Local Convergence of a Primal-Dual Method for Degenerate Nonlinear Programming

Computational Optimization and Applications
A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties

SIAM Journal on Optimization
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we analyze the rate of local convergence of the Newton primal-dual interior-point method when the iterates are kept strictly feasible with respect to the inequality constraints.It is shown under the classical conditions that the rate is q-quadratic when the functions associated to the binding inequality constraints are concave. In general, the q-quadratic rate is achieved provided the step in the primal variables does not become asymptotically orthogonal to any of the gradients of the binding inequality constraints.Some preliminary numerical experience showed that the feasible method can be implemented in a relatively efficient way, requiring a reduced number of function and derivative evaluations. Moreover, the feasible method is competitive with the classical infeasible primal-dual interior-point method in terms of number of iterations and robustness.