2000 character limit reached
Exact penalty functions in optimization with unbounded constraint sets (2507.03424v1)
Published 4 Jul 2025 in math.OC
Abstract: This paper identifies necessary and sufficient conditions for the exactness of penalty functions in optimization problems whose constraint sets are not necessarily bounded. The case where the data of problems is locally Lipschitz or semi-algebraic is studied in detail. The conditions are given in terms of properties of the objective and residual functions of the problems in question. The obtained results generalize and improve some known results in the literature on exact penalty functions.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.