Lecture17 - 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
Advanced Mathematical Programming IE417 Lecture 17 Dr. Ted Ralphs
Background image of page 1

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

View Full DocumentRight Arrow Icon
IE417 Lecture 17 1 Reading for This Lecture Sections 8.6-8.8
Background image of page 2
IE417 Lecture 17 2 Conjugate Directions If H R n × n is symmetric, the linearly independent vectors d 1 ,...,d n are called H-conjugate if d T i Hd j = 0 for i 6 = j . Minimizing the quadratic function f ( x ) = c T x + x T Hx . Given x 1 , any x R n can be represented as x 1 + λ j d j . f ( x ) can be rewritten as a function F of λ . F ( λ ) = c T x 1 + X λ j c T d j + ( x 1 + X λ j d j ) T H ( x 1 + X λ j d j ) = X [ c T ( x 1 + λ j d j ) + ( x 1 + λ j d j ) T H ( x 1 + λ j d j )]
Background image of page 3

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

View Full DocumentRight Arrow Icon
3 Comments on Conjugate Directions The function F is separable so we can minimize over each direction sequentially using line search. Hence, we can minimize any quadratic function in n steps. At the k th step, we end up at the minimum of f over the subspace spanned by d 1 ,...,d k . Also,
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the 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 / 10

Lecture17 - 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