A lagrange penalty reformulation method for constrained optimization

In this paper a constrained optimization problem is transformed into an equivalent one in terms of an auxiliary penalty function. A Lagrange function method is then applied to this transformed problem. Zero duality gap and exact penalty results are obtained without any coercivity assumption on either the objective function or constraint functions. © 2006 Springer-Verlag.C