Convex Optimization I
Free, no sign-up neededArchived courseEnglish
About this course
Concentrates on recognizing and solving convex optimization problems that arise in engineering. 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. Interiorpoint methods.
Description from Stanford Engineering Everywhere.
Where to take this course
- Open Stanford Engineering Everywhere (new tab)Stanford Engineering Everywhere · Archived course