Convex Duality and Calculus: Reduction to Cones
An attempt is made to justify results from Convex Analysis by means of one method. Duality results, such as the Fenchel-Moreau theorem for convex functions, and formulas of convex calculus, such as the Moreau-Rockafellar formula for the subgradient of the sum of sublinear functions, are considered. All duality operators, all duality theorems, all standard binary operations, and all formulas of convex calculus are enumerated. The method consists of three automatic steps: first translation from the given setting to that of convex cones, then application of the standard operations and facts (the calculi) for convex cones, finally translation back to the original setting. The advantage is that the calculi are much simpler for convex cones than for other types of convex objects, such as convex sets, convex functions and sublinear functions. Exclusion of improper convex objects is not necessary, and recession directions are allowed as points of convex objects. The method can also be applied beyond the enumeration of the calculi.
|Keywords||Binary operations, Calculus, Convex analysis, Convex cones, Duality, Optimization|
|Persistent URL||dx.doi.org/10.1007/s10957-009-9574-8, hdl.handle.net/1765/16362|
|Journal||Journal of Optimization Theory and Applications|
Brinkhuis, J. (2009). Convex Duality and Calculus: Reduction to Cones. Journal of Optimization Theory and Applications, 143(3), 439–453. doi:10.1007/s10957-009-9574-8