论文部分内容阅读
There is an increasing need for solving large-scale optimization problems.The sheer size poses new challenge to the analysis and design of efficient algorithms.In this talk,we examine two different issues arising in large-scale optimization.The first part is about the non-convex matrix factorization formulation for matrix completion.This formulation is very popular in practice,but there is little understanding of why it works well.