- Convex Optimization 1 (28.73 KiB) Viewed 30 times
Convex Optimization
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Convex Optimization
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₂.
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₂.