Alternating Minimization for Non-convex Optimization Problems
Alternating Minimization for Non-convex Optimization Problems

Alternating minimization is a popular approach to solve several optimization problems. In this work, we explore theoretical properties of this method (and its variants) for several non-convex optimization problems that feature prominently in several important areas such as recommendation systems, compressive sensing, computer vision etc.

Papers:

 

Talks: