Lagrange Duality for Evenly Convex Optimization Problems

Abstract

An evenly convex function on a locally convex space is an extended real-valued function, whose epigraph is the intersection of a family of open halfspaces. In this paper, we consider an infinite-dimensional optimization problem, for which both objective function and constraints are evenly convex, and we recover the classical Lagrange dual problem for it, via perturbational approach. The aim of the paper was to establish regularity conditions for strong duality between both problems, formulated in terms of even convexity.