Fenchel and Lagrange Duality are Equivalent

Abstract

A basic result in ordinary (Lagrange) convex programming is the saddlepoint duality theorem concerning optimization problems with convex inequalities and linear-affine equalities satisfying a Slater condition. This note shows that this result is equivalent to the duality theorem of Fenchel.