2subgradients

2subgradients - EE236C (Spring 2008-09) 2. Subgradients...

Info iconThis preview shows pages 1–5. 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

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: EE236C (Spring 2008-09) 2. Subgradients definition subgradient calculus optimality conditions via subgradients directional derivative 21 Basic inequality recall basic inequality for convex differentiable f : f ( y ) f ( x ) + f ( x ) T ( y x ) first-order approximation of f at x is global lower bound f ( x ) defines non-vertical supporting hyperplane to epi f at ( x, f ( x )) bracketleftbigg f ( x ) 1 bracketrightbigg T parenleftbiggbracketleftbigg y t bracketrightbigg bracketleftbigg x f ( x ) bracketrightbiggparenrightbigg ( y, t ) epi f what if f is not differentiable? Subgradients 22 Subgradient of a function definition: g is a subgradient of a convex function f at x dom f if f ( y ) f ( x ) + g T ( y x ) for all y dom f x 1 x 2 f ( x 1 ) + g T 1 ( x x 1 ) f ( x 2 ) + g T 2 ( x x 2 ) f ( x 2 ) + g T 3 ( x x 2 ) f ( x ) g 2 , g 3 are subgradients at x 2 ; g 1 is a subgradient at x 1 Subgradients 23 properties f ( x ) + g T ( y x ) is a global lower bound on f g defines non-vertical supporting hyperplane to epi f at ( x, f ( x )) bracketleftbigg g 1 bracketrightbigg T parenleftbiggbracketleftbigg y t bracketrightbigg bracketleftbigg x f ( x ) bracketrightbiggparenrightbigg ( y, t ) epi f if f is convex and differentiable, then f ( x ) is a subgradient of f at x applications algorithms for nondifferentiable convex optimization optimality conditions, duality for nondifferentiable problems Subgradients 24 Example f ( x ) = max { f 1 ( x ) , f 2 ( x ) } f 1 , f 2 convex and differentiable x f 1 ( x ) f 2 ( x ) subgradients at x form line segment [ f 1 ( x ) , f 2 ( x )] if f 1 ( x ) > f 2 ( x ) , subgradient of f at x is f 1 ( x ) if f 1 ( x ) < f 2 ( x ) , subgradient of f at x is f 2 ( x ) Subgradients 25 Subgradients and sublevel sets if g is a subgradient of f at x , then f ( y ) f ( x ) = g T ( y x ) f ( y ) f ( x ) x g f ( x ) x 1 f ( x 1 ) nonzero subgradients at x define supporting hyperplanes to sublevel set { y | f ( y ) f ( x ) } Subgradients 26 Subdifferential subdifferential of f at x dom f is the set of all subgradients of f at x notation: f ( x ) properties f ( x ) is a closed convex set (possibly empty) proof: f ( x ) is an intersection of halfspaces f ( x ) = braceleftbig g | f ( x ) + g T ( y x ) f ( y ) y dom f bracerightbig if x int dom f then f ( x ) is nonempty and bounded Subgradients 27 Examples absolute value f ( x ) = | x | f ( x ) = | x | f ( x ) x x 1...
View Full Document

This note was uploaded on 01/25/2010 for the course EE 236 taught by Professor Staff during the Spring '08 term at UCLA.

Page1 / 15

2subgradients - EE236C (Spring 2008-09) 2. Subgradients...

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

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