ee227a_review_soln - UC Berkeley Department of Electrical...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: UC Berkeley Department of Electrical Engineering and Computer Science EECS 227A Nonlinear and Convex Optimization Solutions 1 Fall 2009 Review 1.1 For future reference, the function f has the following first and second derivatives: f x ( x, y ) = 4 x 3 4 yx 20 x f y ( x, y ) = 2 x 2 + 2 y 2 f y 2 ( x, y ) = 4 x 2 f xy ( x, y ) = 2 (a) Note that f (1 , 0) = f ( 1 , 0) = 9, so that 1 2 f (1 , 0) + 1 2 f ( 1 , 0) = 9. On the other hand, we have f (0 , 0) = 0 > 9, showing that f is not convex. (b) We need to solve f ( x, y ) = 0 for ( x, y ) R 2 . Taking derivatives yields f ( x, y ) = bracketleftbig 4 x ( x 2 y ) 20 x 2( x 2 y ) bracketrightbig T By inspection, ( x, y ) = (0 , 0) is the only stationary point. It is neither a local maximum nor a local minimum, since f ( , 0) = 4 10 2 < 0 for small enough, and f (0 , ) = 2 > 0 for negationslash = 0. Alternatively, we may compute the Hessian matrix 2 f (0 , 0) = parenleftbigg 20 0 2 parenrightbigg which is indefinite, showing (0 , 0) is neither a local minimum nor a local maximum. (c) The function f is convex. The set C is bounded in the y-direction, and the function value tends to infinity as | x | increases, so that a global minimum exists and is attained. By necessary optimality condition for constrained optimization to solve this problem, if ( x , y ) is global minimum it needs to satisfy f ( x , y ) T bracketleftbiggparenleftbigg x y parenrightbigg parenleftbigg x y parenrightbiggbracketrightbigg , ( x, y ) X In part (b), we showed that f has only one stationary point in the interior of the given set, and it is not a minimum. Hence, the minimum must occur on the boundary of the set i.e., either at some point ( x , 1) or some point ( x , 0), and we must have f x ( x , 1) = 0 or f x ( x , 0) = 0. For y = 0, we have f ( x, 0) = x 4 10 x 2 . Since f x ( x, 0) = 4 x 3 20 x 2 , the relevant stationary points are at x = 5, with f ( 5 , 0) = 25 50 = 25. Otherwise, for y = 1, we have f ( x, 1) = x 4 12 x 2 +1. We have f x ( x, 1) = 4 x 3 24 x , so stationary points are found at x = 6 with f ( 6 , 0) = 35. Checking second derivatives shows that this is the global optimum. 1 Review 1.2 Using KKT conditions, we have g j ( x ) , j = 1 , . . . , m j , j = 1 , . . . , m j g j ( x ) = 0 , j = 1 , . . . , m f ( x ) + m summationdisplay j =1 j g j ( x ) = 0 So f ( x ) T ( x x ) = m summationdisplay j =1 j g j ( x ) T ( x x ) Since g j , j = 1 , . . . , m are convex functions: g j ( x ) T ( x x )...
View Full Document

This note was uploaded on 09/03/2011 for the course EE 227A taught by Professor Staff during the Spring '11 term at University of California, Berkeley.

Page1 / 6

ee227a_review_soln - UC Berkeley Department of Electrical...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online