Convex Analysis for Optimization pp 53-64 | Cite as

# Convex Sets: Binary Operations

- 56 Downloads

## Abstract

• Why. You need the Minkowski sum and the convex hull of the union, two binary operations on convex sets, to solve optimization problems. A convex function *f* has a minimum at a given point \(\widehat x\) iff the origin lies in the subdifferential \(\partial f(\widehat x)\), a certain convex set. Now suppose that *f* is made from two convex functions *f*_{1}, *f*_{2} with known subdifferentials at \(\widehat x\), by one of the following two binary operations for convex functions: either the pointwise sum (*f* = *f*_{1} + *f*_{2}) or the pointwise maximum (*f* = max(*f*_{1}, *f*_{2}) ), and, in the latter case, \(f_1(\widehat x)=f_2(\widehat x)\). Then \(\partial f(\widehat x)\) can be calculated, and so it can be checked whether it contains the origin or not: \(\partial (f_1+f_2)(\widehat x)\) is equal to the Minkowski sum of the convex sets \(\partial f_1(\widehat x)\) and \(\partial f_2(\widehat x)\) and \(\partial (\max (f_1,f_2))(\widehat x)\) is equal to the convex hull of the union of \(\partial f_1(\widehat x)\) and \(\partial f_2(\widehat x)\) in the difficult case that \(f_1(\widehat x)=f_2(\widehat x)\).

• What. The four standard binary operations for convex sets are the Minkowski sum, the intersection, the convex hull of the union and the inverse sum. The defining formulas for these binary operations look completely different, but they can all be generated in exactly the same systematic way by a reduction to convex cones (‘homogenization’). These binary operations preserve closedness for polyhedral sets but not for arbitrary convex sets.

*Road Map*

• Section 2.1.1 (motivation binary operations convex sets).

• Section 2.1.2 (crash course in working coordinate-free).

• Section 2.2 (construction binary operations +, ∩ for convex cones by homogenization; the fact that the sum map and the diagonal map are each others transpose).

• Section 2.3 (construction of one binary operation for convex sets by homogenization).

*#*for convex sets by homogenization; note that not all of these preserve the nice properties closedness and properness).

## References

- 1.R.T. Rockafellar,
*Convex Analysis*(Princeton University, Princeton, 1970)CrossRefGoogle Scholar - 2.V.M. Tikhomirov,
*Convex Analysis*. Analysis II, Encyclopaedia of Mathematical Sciences, vol. 14 (Springer, Berlin, 1990)Google Scholar - 3.G.G. Magaril-Ilyaev, V.M. Tikhomirov,
*Convex Analysis: Theory and Applications*. Translations of Mathematical Monographs, vol. 222 (American Mathematical Society, Providence, 2003)Google Scholar - 4.J. Brinkhuis, V.M. Tikhomirov, Duality and calculus of convex objects. Sb. Math.
**198**(2), 171–206 (2007)CrossRefGoogle Scholar - 5.J. Brinkhuis, Convex duality and calculus: reduction to cones. J. Optim. Theory Appl.
**143**, 439 (2009)CrossRefGoogle Scholar