Compare with 1 courses
Convex Optimization II
Free
Overview 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 and bound. Robust optimization. Selected applications in areas such as control, circuit design, signal processing, and communications.
Learn more
0 