Convergence Proof, Stopping Criterion, Example: Piecewise Linear Minimization, Optimal Step Size When F* Is Known, Finding A Point In The Intersection Of Convex Sets, Alternating Projections, Example: Positive Semidefinite Matrix Completion, Speeding Up Subgradient Methods, A Couple Of Speedup Algorithms, Subgradient Methods For Constrained Problems, Projected Subgradient Method, Linear Equality Constraints, Example: Least L_1-Norm
Continuation of Convex Optimization I. Topics include: 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.
One of the world's leading universities, Stanford was founded in 1885 in what is now Stanford, California. It is comprised of seven schools, four of which are devoted exclusively to graduate education. Stanford's most renowned programs include the Graduate School of Business, Law School, School of Engineering, and School of Medicine. Notable alumni include author John Steinbeck, Supreme Court Justice William Rehnquist, and Google founders Sergey Brin and Larry Page.