2 papers
math.OC2018
Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDPs
Murat A. Erdogdu, Asuman Ozdaglar, Pablo A. Parrilo +1
Semidefinite programming (SDP) with diagonal constraints arise in many optimization problems, such as Max-Cut, community detection and group synchronization. Although SDPs can be s…
math.OC2018
Randomness and Permutations in Coordinate Descent Methods
Mert Gurbuzbalaban, Asuman Ozdaglar, Nuri Denizcan Vanli +1
We consider coordinate descent (CD) methods with exact line search on convex quadratic problems. Our main focus is to study the performance of the CD method that use random permuta…