OPTIMIZATION, vol.52, no.1, pp.1-28, 2003 (SCI-Expanded)
We study a nonlinear exact penalization for optimization problems with a single constraint. The penalty function is constructed as a convolution of the objective function and the constraint by means of increasing positively homogeneous (IPH) functions. The main results are obtained for penalization by strictly IPH functions. We show that some restrictive assumptions, which have been made in earlier researches on this topic, can be removed. We also compare the least exact penalty parameters for penalization by different convolution functions. These results are based on some properties of strictly IPH functions that are established in the article.