Stanford Engineering Everywhere EE364B - Convex Optimization II
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Continuation of Convex Optimization I. Subgradient, cutting-plane, and ellipsoid methods. Decentralized convex optimization via primal and dual decomposition. Alternating projections. Exploiting problem structure in implementation. Convex relaxations of hard problems, and global optimization via branch & bound. Robust optimization. Selected applications in areas such as control, circuit design, signal processing, and communications. Course requirements include a substantial project.
Prerequisites: Convex Optimization I
Course features at Stanford Engineering Everywhere page: