Use the maximizing-dual convention. For the perturbation function , define
The primal problem is ; the Lagrangian dual problem is . The sign convention makes the dual marginal concave for jointly convex data; some formulations negate to express a minimization problem.
The central convex perturbation duality calculation is
The last inequality is weak duality. A sufficient finite-dimensional condition for strong duality with dual attainment is: is jointly proper and convex, is proper with finite, and is finite on a neighborhood of zero. More generally suffices.
Indeed continuity of a convex function on the interior of its domain gives a supporting subgradient , so
Therefore and the dual maximum is attained. This qualification establishes equality and dual attainment; it does not by itself establish a primal minimizer.

Articles by others on the same topic (0)

There are currently no matching articles.