On the convergence of a smoothed penalty algorithm for semi-infinite programming

For semi-infinite programming (SIP), we consider a class of smoothed penalty functions, which approximate the exact <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$l_\rho (0>\rho \le 1)$$</EquationSource> </InlineEquation> penalty functions. On base of the smoothed penalty function, we present a feasible penalty algorithm for solving SIP. Without any boundedness condition or coercive condition, we establish the global convergence theorem. Then we present a perturbation theorem for this algorithm and obtain a necessary and sufficient condition for the convergence to the optimal value of SIP. Under Mangasarian–Fromovitz constrained qualification condition, we further discuss the convergence properties for the algorithm based upon a subclass of smooth approximations to the exact <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$l_\rho $$</EquationSource> </InlineEquation> penalty function. Finally, numerical results are given. Copyright Springer-Verlag Berlin Heidelberg 2013