Convex Optimization
Posted: Mon Jul 11, 2022 12:15 pm
Convex Optimization
Represent the set {x = (x1, x₂) € R² | 1x2 ≥ 1}, as the intersection of some family of halfspaces. Consider two nonempty interior convex cones K₁ and K₂. Show that if int Kin int K₂ = Ø, then there is y 0 such that, y € K†, −y € K₂.
- Convex Optimization 1 (28.73 KiB) Viewed 32 times