MATH 671 Methods of Optimization II 3.0 Credits
Covers necessary and sufficient conditions for unconstrained and constrained optimization. Includes computational methods including quasi-Newtonian and successive quadratic programming, and penalty and interior methods.
Repeat Status: Not repeatable for credit