Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function Martin Tak´aˇc The University of Edinburgh

First Page		Document Content
Date: 2015-07-28 19:28:44		Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function Martin Tak´aˇc The University of Edinburgh Add to Reading List Source URL: pdfs.semanticscholar.org Download Document from Source Website File Size: 2,80 MB Share Document on Facebook