Convex Optimization · Problem 2.16

Convex functions — Boyd & Vandenberghe

Mathematics — Optimization · partial-sum-convex-sets

Problem

Show that if S1S_1 and S2S_2 are convex sets in Rm+n\mathbf{R}^{m+n}, then so is their partial sum S={(x,y1+y2)∣x∈Rm,  y1,y2∈Rn,  (x,y1)∈S1,  (x,y2)∈S2}.S = \{(x, y_1 + y_2) \mid x \in \mathbf{R}^m, \; y_1, y_2 \in \mathbf{R}^n, \; (x, y_1) \in S_1, \; (x, y_2) \in S_2\}.

Related theory

Browse the problem library