This preview shows pages 1–3. 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: MS&E 211 Fall 2007 Linear and Nonlinear Optimization Nov 1, 2007 Prof. Yinyu Ye Homework Assignment 4: Due 3:15pm Friday, Nov 9 There is a homework collecting box outside of professor Ye’s office (Terman 316) for you to submit your homework. No late homework accepted! Problem 1 Let X be defined as: X = { x = ( x 1 , x 2 ) : k x k ≤ 1 . 2 ,  x i  ≥ 1 , for i ∈ (1 , 2) } . a) Plot the region defined by X . Is it convex? b) Let f ( x ) be defined as: f ( x ) = x 1 + x 2 . Find all global, local minimum points constrained on set X . Problem 2 Consider the function f : R + → R defined by: f ( x ) = x = 0 x ln x x > a) Is this function continuous? Does it have a minimizer under nonnegativity constraint? Justify your answer. (Note that f ( x ) is a convex function.) b) An entropy optimization problem that is frequently used in information science has the following general form: Minimize X i ∈ I f ( x i ) subject to X i ∈ I a i x i = 1 x i ≥ , ∀ i ∈ I Here I = { 1 , 2 , ...N, ....
View
Full
Document
This note was uploaded on 06/16/2010 for the course MS&E 211 taught by Professor Yinyuye during the Fall '07 term at Stanford.
 Fall '07
 YINYUYE

Click to edit the document details