Maximum Margin Matrix Factorization using Smooth Semidefinite Optimization
Introduction • Semidefinite programming (SDP): efficient solutions to highly nonlinear problems. • Interior Point solvers: memory constraints limit the max. problem size. • First-order method (Bundle, subgradient, etc): limited memory requirements but very slow convergence. • Today: optimal first-order methods for structured semidefinite programs.