Global and local optimization, constrained and unconstrained optimization, convex versus nonconvex optimization, Projection Theorem, linear search methods, gradient methods, Newton and Quasi-Newton methods, trust region methods.
Prerequisites: Math 6A and 108A, each with a minimum grade of C.
Xin Su
2.3