Convex Optimization (CS-0168)

Fall 2024 · CS 0168 · Tufts University · 3 credits · Undergraduate

Convex optimization theory and algorithms. Convex sets, convex functions and convex optimization problems; duality theory and optimality conditions; algorithms for solving convex problems including descent, gradient descent, Newton and interior point methods. Examples of applications taken from communications, signal processing, machine learning and other fields. Students may receive credit for only one of the following courses: EE109, EE159, or CS169

Course codes: CS-0168, CS 0168, CS0168, CS-168, CS 168, CS168, EE-0109, EE 0109, EE0109, EE-109, EE 109, EE109

Course Discovery