MATH132A
Download as PDF
MATH 132A - Optimization
Mathematics
College of Letters and Science
Full Course Title
Optimization
Instructor Name(s)
STAFF
Course Description
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.
Unit Value
4
Maximum number of times course can be repeated for additional credit
0
Maximum Units
4