StanfordOnline: Convex Optimization
Last updated on January 9, 2026 1:41 pm
This course concentrates on recognizing and solving convex optimization problems that arise in applications. The syllabus includes: convex sets, functions, and optimization problems; basics of convex analysis; least-squares, linear and quadratic programs, semidefinite programming, minimax, extremal volume, and other problems; optimality conditions, duality theory, theorems of alternative, and applications; interior-point methods; applications to signal processing, statistics and machine learning, control and mechanical engineering, digital and analog circuit design, and finance.
User Reviews
Be the first to review “StanfordOnline: Convex Optimization”
You must be logged in to post a review.
×
There are no reviews yet.