This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.
This course will focus on formulating and solving convex optimization problems arising in engineering and science. Topics include: convex analysis, linear and quadratic programming, semidefinite programming, optimality conditions, duality theory, interior-point methods, subgradient methods, convex relaxation.
Modeling and application