Parallel coordinate descent methods for big data optimization
Top Cited Papers
Open Access
- 12 April 2015
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 156 (1-2) , 433-484
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Parallel and distributed sparse optimization2013
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraintsComputational Optimization and Applications, 2013
- Subgradient methods for huge-scale optimization problemsMathematical Programming, 2013
- Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: Application to distributed MPCJournal of Process Control, 2013
- Gradient methods for minimizing composite functionsMathematical Programming, 2012
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite functionMathematical Programming, 2012
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization ProblemsSIAM Journal on Optimization, 2012
- Randomized Methods for Linear Constraints: Convergence Rates and ConditioningMathematics of Operations Research, 2010
- Coordinate descent optimization for l1 minimization with application to compressed sensing; a greedy algorithmInverse Problems and Imaging, 2009
- Introductory Lectures on Convex Optimization2004