Convex Optimization (EE364A)
Stephen Boyd
![Convex Optimization (EE364A)](/assets/artwork/1x1.gif)
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. Applications to signal processing, control, digital and analog circuit design, computational geometry, statistics, and mechanical engineering.
About
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. Applications to signal processing, control, digital and analog circuit design, computational geometry, statistics, and mechanical engineering.
Information
- CreatorStephen Boyd
- Episodes19
- Show Website
More From Stanford
- ScienceComplete
- GovernmentUpdated Biweekly
- PhilosophyUpdated 09/29/2008
- TechnologyUpdated 07/23/2008
- ScienceUpdated 11/12/2010
- EducationUpdated Semimonthly
- BusinessUpdated 12/20/2013