A method is proposed to smooth the square-order exact penalty function for inequality constrained optimization. It is shown that, under some conditions, an approximately optimal solution of the original problem can be obtained by searching an approximately optimal solution of the smoothed penalty problem. An algorithm based on the smoothed penalty functions is given. The algorithm is shown to be convergent under mild conditions. Two numerical examples show that the algorithm seems efficient.
"Smoothing Approximation to the Square-Order Exact Penalty Functions for Constrained Optimization." J. Appl. Math. 2013 1 - 7, 2013. https://doi.org/10.1155/2013/568316