In this article, we study the nonlinear penalization of a constrained optimization problem and show that the least exact penalty parameter of an equivalent parametric optimization problem can be diminished. We apply the theory of increasing positively homogeneous (IPH) functions so as to derive a simple formula for computing the least exact penalty parameter for the classical penalty function through perturbation function. We establish that various equivalent parametric reformulations of constrained optimization problems lead to reduction of exact penalty parameters. To construct a Lipschitz penalty function with a small exact penalty parameter for a Lipschitz programming problem, we make a transformation to the objective function by virtue of an increasing concave function. We present results of numerical experiments, which demonstrate that the Lipschitz penalty function with a small penalty parameter is more suitable for solving some nonconvex constrained problems than the classical penalty function.
We study topical and sub-topical functions (i.e., functions f : Rn → R = [-∞, +∞] which are increasing in the natural partial ordering of Rn and additively homogeneous, respectively additively sub-homogeneous), and downward sets (i.e., subsets of ℝn which contain, along with each element, all smaller elements), in the framework of abstract convex analysis, with the aid of the additive min-type coupling function