CSE 203B. Convex Optimization Formulations and Algorithms (4 units)
Link to catalog page: https://catalog.ucsd.edu/courses/CSE.html#cse203b
Description
We study the formulations and algorithms solving convex optimization problems. The topics include convex sets, functions, optimality conditions, duality concepts, gradient descent, conjugate gradient, interior-point methods, and applications. The objective of the course is to provide students the background and techniques for scientific computing and system optimization. Students cannot receive credit for CSE 203B if they have taken either ECE 273 or MATH 245B. Prerequisites: Linear Algebra is recommended.
Prerequisite courses
CSE 203B has no prerequisite courses.
Successor courses
No courses have CSE 203B as a prerequisite.