For semi-infinite programming (SIP), we consider a class of smoothed penalty functions, which approximate the exact $$l_\rho (0\rho \le 1)$$ penalty functions. On base of the smoothed penalty function, we present a feasible penalty algorithm for solving SIP. Without any boundedness condition or...

In this paper, in order to solve semismooth equations with box constraints, we present a class of smoothing SQP algorithms using the regularized-smooth techniques. The main difference of our algorithm from some related literature is that the correspondent objective function arising from the...