This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Math464  HW 6 Due on Thursday, Feb 25 1 Linear Optimization (Spring 2010) Brief solutions to Homework 6 1. To get a contradiction, assume that there is a point x S with f ( x ) < f ( x * ). Notice that x has to be nonlocal to x * , i.e., k x x * k > , else it will violate the fact that x * is a local optimum. The line segment joining x * and x will lie inside S (as S is convex), but will partly be outside the sphere of radius centered at x * . Consider a point y on this line segment that is inside this sphere, i.e., k y x * k < . Thus, y is a convex combination of x * and x , and is also local to x * . Since it is local to x * , we must have f ( y ) f ( x * ) , (1) by the definition of local minimum. With y = x * +(1 ) x for some 0 < < 1, we use the fact that f is a convex function to write f ( y ) = f ( x * + (1 ) x ) f ( x * ) + (1 ) f ( x ) . (2) Using the result in Equation (1), we get f ( x * ) + (1 ) f ( x ) f ( y ) f ( x * ) ,...
View Full
Document
 Spring '10
 Bertsekas
 Optimization

Click to edit the document details