Formulation and Theory of the Newton Interior-Point Method for Nonlinear Programming.

摘要

In this work we first study in detail the formulation of the primal- dual interior- point method for linear programming. We show that, contrary to popular belief, it cannot be viewed as the damped Newton method applied to the Karush-Kuhn-Tucker conditions for the logarithmic barrier function problem. Next we extend the formulation to general nonlinear programming, and then validate this extension by demonstrating that this algorithm can be implemented so that it is locally and Q-quadratically convergent under only the standard Newton's method assumptions. We also establish a global convergence theory for this algorithm and include promising numerical experimentation.