This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Ay p b are strictly feasible. (f) f ( x ) = sup Ay p b y T x . (You can assume that the polyhedron de±ned by Ay p b is bounded.) 2. A convex function that is not subdiFerentiable. Verify that the following function f : R → R is convex, but not subdi²erentiable at x = 0: f ( x ) = b 1 x = 0 x > , with dom f = R + . 1...
View Full Document
This note was uploaded on 04/09/2010 for the course EE 360B taught by Professor Stephenboyd during the Fall '09 term at Stanford.
- Fall '09