A Simple Primal-Dual Feasible Interior-Point Method for Nonlinear Programming with Monotone Descent

Sasan Bakhtiari (sasanbisr.umd.edu)
Andre L. Tits (andreisr.umd.edu)

Abstract: We propose and analyze a primal-dual interior point method of the ``feasible'' type, with the additional property that the objective function decreases at each iteration. A distinctive feature of the method is the use of different barrier parameter values for each constraint, with the purpose of better steering the constructed sequence away from non-KKT stationary points. Assets of the proposed scheme include relative simplicity of the algorithm and of the convergence analysis, strong global and local convergence properties, and good performance in preliminary tests. In addition, the initial point is allowed to lie on the boundary of the feasible set.

Keywords: nonlinear programming, interior point, feasible itereates, global convergence, local convergence

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: To appear in Computational Optimization and Applications

Download: [Postscript][PDF]

Entry Submitted: 10/29/2002
Entry Accepted: 10/29/2002
Entry Last Modified: 10/29/2002

Modify/Update this entry