MATH 164
Optimization
Mathematics · 4 units · Undergraduate upper division (100-199)
Not open for credit to students with credit for former Electrical Engineering 136. Fundamentals of optimization. Linear programming: basic solutions, simplex method, duality theory. Unconstrained optimization, Newton method for minimization. Nonlinear programming, optimality conditions for constrained problems. Additional topics from linear and nonlinear programming.
P/NP or letter grading.
Requisites
Official UCLA wording
Enforced requisites: courses 115A, 131A.
Requires
Everything that has to come before this course, not just the courses named in the requisite above.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
MATH 164
- MATH 156Machine Learning
- MATH M148Experience of Data Science
- STATS 147Data Technologies for Data Scientists
- STATS M148Experience of Data Science
- STATS C163Generative Data Science





