Convergence analysis of a primal-dual interior-point method for nonlinear programming

We analyze a primal-dual interior-point method for nonlinear programming. We prove the global convergence for a wide class of problems under the standard assumptions on the problem.

Citation

Technical Report ORFE-04-07, Department of ORFE, Princeton University, Princeton, NJ 08544

Article

Download

View PDF