Lecture15

Lecture15 - C&O 355 Mathematical Programming Fall 2010...

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

View Full Document Right Arrow Icon
C&O 355 Mathematical Programming Fall 2010 Lecture 15 N. Harvey
Background image of page 1

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

View Full DocumentRight Arrow Icon
Topics Minimizing over a convex set: Necessary & Sufficient Conditions (Mini)- KKT Theorem Minimizing over a polyhedral set: Necessary & Sufficient Conditions Smallest Enclosing Ball Problem
Background image of page 2
Proof: ( direction Direct from subgradient inequality. (Theorem 3.5) f(z) ¸ f(x) + r f(x) T (z-x) ¸ f(x) Subgradient inequality Our hypothesis Thm 3.12: Let C µ R n be a convex set. Let f : R n ! R be convex and differentiable. Then x minimizes f over C iff r f(x) T (z-x) ¸ 0 8 z 2 C. Minimizing over a Convex Set: Necessary & Sufficient Conditions
Background image of page 3

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

View Full DocumentRight Arrow Icon
Minimizing over a Convex Set: Necessary & Sufficient Conditions Thm 3.12: Let C µ R n be a convex set. Let f : R n ! R be convex and differentiable. Then x minimizes f over C iff r f(x) T (z-x) ¸ 0 8 z 2 C. Proof: ) direction Let x be a minimizer, let z 2 C and let y = z-x. Recall that r f(x) T y = f’(x;y) = lim t ! 0 f(x+ty)-f(x). If limit is negative then we have f(x+ty)<f(x) for some t 2 [0,1], contradicting that x is a minimizer. So the limit is non-negative, and r f(x) T y ¸ 0. ¥ t
Background image of page 4
Smallest Ball Problem Let { p 1 ,…, p n } be points in R d . Find (unique!) ball (not an ellipsoid!) of smallest volume that contains all the p i ’s. In other words, we want to solve: min { r : 9 y 2 R d s.t. p i 2 B( y , r ) 8 i } y r
Background image of page 5

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

View Full DocumentRight Arrow Icon
Smallest Ball Problem Let { p 1 ,…, p n } be points in R d . Find (unique!) ball (not an ellipsoid!) of smallest volume that contains all the p i ’s. In other words, we want to solve: min { r : 9 y 2 R d s.t. p i 2 B( y , r ) 8 i } We will formulate this as a convex program. In fact, our convex program will be of the form min { f(x) : Ax=b, x ¸ 0 }, where f is convex.
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/16/2011 for the course CO 355 taught by Professor Harvey during the Winter '10 term at Waterloo.

Page1 / 18

Lecture15 - C&O 355 Mathematical Programming Fall 2010...

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

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