{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hw1 - Ay p b are strictly feasible(f f x = sup Ay p b y T...

This preview shows page 1. Sign up to view the full content.

EE364b Prof. S. Boyd EE364b Homework 1 1. For each of the following convex functions, explain how to calculate a subgradient at a given x . (a) f ( x ) = max i =1 ,...,m ( a T i x + b i ). (b) f ( x ) = max i =1 ,...,m | a T i x + b i | . (c) f ( x ) = sup 0 t 1 p ( t ), where p ( t ) = x 1 + x 2 t + · · · + x n t n 1 . (d) f ( x ) = x [1] + · · · + x [ k ] , where x [ i ] denotes the i th largest element of the vector x . (e) f ( x ) = inf Ay precedesequal b bardbl x y bardbl 2 2 , i.e. , the square of the Euclidean distance of x to the polyhedron defined by Ay precedesequal b . You may assume that the inequalities
This is the end of the preview. Sign up to access the rest of the document.

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

{[ snackBarMessage ]}

Ask a homework question - tutors are online