Non-Linear Optimization Theory

This course is an introduction to nonlinear programming. Topics will include necessary and sufficient conditions for optimality, as well as basic theory and numerical algorithms for several traditional optimization methods, e.g., basic descent methods, conjugate direction methods, quasi-Newton methods, penalty and barrier methods, Lagrange multiplier methods. A brief introduction to selected modern topics may be added if time permits.