Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization (Q618891)

Firstly, the authors indicate a dual approach for the inequalities between two convex lower semicontinuous extended real-valued functions, having immediate applications when one of them is the sum of two convex functions with a convex composite one and to the subdifferential calculus of such as this function, without any constraint qualification. As consequences, one obtains extensions to nonreflexive settings, Farkas-type lemmas and significant results on DC, convex, semi-definite and linear optimization programs.