IE 514 Nonlinear Programming

Credit Information: 
(3+0+0) 3
Description: 
Convex analysis; necessary and sufficient conditions for optimality, methods of unconstrained optimization, necessary and sufficient conditions for constrained optimization, methods for handling equality and inequality constraints, nonlinear programming methods such as primal methods and penalty function methods.