本文对可微非线性规划问题提出了一个渐近算法,它是基于一类逼近l1精确罚函数的罚函数而提出的,我们证明了算法所得的极小点列的聚点均为原问题的最优解,并在Mangasarian-Fromovitz约束条件下,证明了有限次迭代之后,所有迭代均为可行的,即迭代所得的极小点为可行点.
In this paper, we study the asymptotic behavior of methods based on a family of penalty functions that approximate asymptotically the usual exact penalty function for the differentiable nonlinear programming problem. We prove that the minimizer sequence generated by the algorithm is bounded, and its accumulation points are optimal solutions of primal problem. We show that for problems satisfying the Mangasarian-Fromovitz constraint qualification all iterates will remain feasible after a finite number of iterations.