This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Advanced Mathematical Programming IE417 Lecture 12 Dr. Ted Ralphs IE417 Lecture 12 1 Reading for This Lecture Chapter 6, Section 4 IE417 Lecture 12 2 Solving the Lagrangian Dual IE417 Lecture 12 3 Solving the Lagrangian Dual Since ( ,v ) is concave, we can use a linesearch algorithm to maximize it. If is differentiable, then ( * ,v * ) T = ( g ( x * ) T , h ( x * ) T ) is an ascent direction. Move in this direction as far as is feasible. Move in a projected direction if i = 0 and g i ( x * ) < for some index i . If is not differentiable, then we have to work with subgradients. Finding the direction of steepest ascent in this case is an optimization problem. In practice, you may not want to move as far as possible each time. IE417 Lecture 12 4 Subgradient Algorithm for the Lagrangian Dual The idea of the subgradient algorithm is to first fix ,v and solve the Lagrangian subproblem to get x ....
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 .
 Fall '08
 Linderoth

Click to edit the document details