Characterizations of ?-duality gap statements for constrained optimization problems : Open Mathematics

摘要

In this paper we present different regularity conditions that equivalently characterize various ?-duality gap statements (with ? ≥ 0) for constrained optimization problems and their Lagrange and Fenchel-Lagrange duals in separated locally convex spaces, respectively. These regularity conditions are formulated by using epigraphs and ?-subdifferentials. When ? = 0 we rediscover recent results on stable strong and total duality and zero duality gap from the literature.