MATH 271A-B-C. Numerical Optimization (4-4-4 units)
Link to catalog page: https://catalog.ucsd.edu/courses/MATH.html#math271c
Description
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: consent of instructor.
Prerequisite courses
MATH 271A-B-C has no prerequisite courses.
Successor courses
No courses have MATH 271A-B-C as a prerequisite.