Units: 3
Unconstrained and constrained optimization problems from a numerical standpoint. Topics include variable metric methods, optimality conditions, quadratic programming, penalty and barrier function methods, interior point methods, successive quadratic programming methods.
Prerequisite(s): SIE 340
Usually offered: Fall