Lecture21 - Advanced Mathematical Programming IE417 Lecture...

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: Advanced Mathematical Programming IE417 Lecture 21 Dr. Ted Ralphs IE417 Lecture 21 1 Reading for this lecture Sections 9.4-9.5 IE417 Lecture 21 2 Barrier Methods So far, we have talked about exterior penalty methods . Now, we move on to interior penalty methods or interior point methods . The idea is similar, except now we start with a feasible point and impose a steep penalty for approaching the boundary. Previously, we let the penalty multiplier go to infinity. Now, we will let the penalty itself go to infinity. For reasons which will be obvious, these methods only work with inequality constraints. IE417 Lecture 21 3 Barrier Functions A barrier function is B ( x ) = m i =1 ( g i ( x )) where is a continuous function of one variable, ( y ) 0 if y < , lim y + ( y ) = , Example : ( y ) =- 1 /y, ( y ) = log(min { 1 ,- y } ) Consider ( ) = inf { f ( x ) + B ( x ) : x X } What happens if we solve min ( ) s.t. IE417 Lecture 21...
View Full Document

This note was uploaded on 08/06/2008 for the course IE 417 taught by Professor Linderoth during the Fall '08 term at Lehigh University .

Page1 / 12

Lecture21 - Advanced Mathematical Programming IE417 Lecture...

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