Numerical Optimization

4-4-4 credits

Formulation and analysis of algorithms for constrained optimization. Optimality conditions; linear and quadratic programming; interior methods; penalty and barrier function methods; sequential quadratic programming methods. Prerequisites: consent of instructor.