A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- 19 September 2013
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 57 (2) , 307-337
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: Application to distributed MPCJournal of Process Control, 2013
- On the Nonasymptotic Convergence of Cyclic Coordinate Descent MethodsSIAM Journal on Optimization, 2013
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization ProblemsSIAM Journal on Optimization, 2012
- Parallel and distributed optimization methods for estimation and control in networksJournal of Process Control, 2011
- LIBSVMACM Transactions on Intelligent Systems and Technology, 2011
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines trainingComputational Optimization and Applications, 2008
- A coordinate gradient descent method for nonsmooth separable minimizationMathematical Programming, 2007
- Model Selection and Estimation in Regression with Grouped VariablesJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- Interior-Point Methods for Massive Support Vector MachinesSIAM Journal on Optimization, 2002
- Atomic Decomposition by Basis PursuitSIAM Review, 2001