  


InteriorPoint l_2 Penalty Methods for Nonlinear Programming with Strong Global Convergence Properties
Lifeng Chen (lc2161columbia.edu) Abstract: We propose two line search primaldual interiorpoint methods that approximately solve a equence of equality constrained barrier subproblems. To solve each subproblem, our methods apply a modified Newton method and use an $\ell_2$exact penalty function to attain feasibility. Our methods have strong global convergence properties under standard assumptions. Specifically, if the penalty parameter remains bounded, any limit point of the iterate sequence is either a KKT point of the barrier subproblem, or a FritzJohn (FJ) point of the original problem that fails to satisfy the MangasarianFromovitz constraint qualification (MFCQ); if the penalty parameter tends to infinity, there is a limit point that is either an infeasible FJ point of the inequality constrained feasibility problem (an infeasible stationary point of the infeasibility measure if slack variables are added) or a FJ point of the original problem at which the MFCQ fails to hold. Numerical results are given that illustrate these outcomes. Keywords: constrained optimization, nonlinear programming, primaldual interiorpoint, global convergence, penaltybarrier method, modified Newton Category 1: Nonlinear Optimization Citation: CORC TR200408, Columbia University Download: [Postscript][PDF] Entry Submitted: 05/27/2005 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  