Lect01

# Lect01 - D Bertsekas EE553 LECTURE 1 LECTURE OUTLINE...

This preview shows pages 1–4. Sign up to view the full content.

EE553 LECTURE 1 LECTURE OUTLINE Nonlinear Programming Application Contexts Characterization Issue Computation Issue Duality Organization D. Bertsekas Adapted for USC EE553 by M. Safonov © D. Bertsekas, MIT, Cambridge, MA

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

View Full Document
NONLINEAR PROGRAMMING min x X f ( x ) , where f : ± n ²→± is a continuous (and usually differ- entiable) function of n variables X = ± n or X is a subset of ± n with a “continu- ous” character. If X = ± n , the problem is called unconstrained If f is linear and X is polyhedral, the problem is a linear programming problem. Otherwise it is a nonlinear programming problem Linear and nonlinear programming have tradi- tionally been treated separately. Their method- ologies have gradually come closer. Adapted for USC EE553 by M. Safonov © D. Bertsekas, MIT, Cambridge, MA
TWO MAIN ISSUES Characterization of minima Necessary conditions Sufﬁcient conditions Lagrange multiplier theory Sensitivity Duality Computation by iterative algorithms Iterative descent Approximation methods Dual and primal-dual methods Adapted for USC EE553 by M. Safonov © D. Bertsekas, MIT, Cambridge, MA

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 12

Lect01 - D Bertsekas EE553 LECTURE 1 LECTURE OUTLINE...

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

View Full Document
Ask a homework question - tutors are online