MATH 271BNumerical Optimization
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
From the catalog: “consent of instructor.”