Penalized interior point approach for constrained nonlinear programming

摘要

A penalized interior point approach for constrained nonlinear programming is examined in this work.To overcome the difficulty of initialization for the interior point method,a problem equivalent to the primal problem via incorporating an auxiliary variable is constructed.A combined approach of logarithm barrier and quadratic penalty function is proposed to solve the problem.Based on Newton's method,the global convergence of interior point and line search algorithm is proven.Only a finite number of iterations is required to reach an approximate optimal solution.Numerical tests are given to show the effectiveness of the method.