Fetching the paper…
Reading the bibliography…
In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite objective functions.
R.T. Rockafeller, The elementary vectors of a subspace in ℝ N \mathbb{R}^{N} , Combinatorial Mathematics and its Applications, Proceedings of the Chapel Hill Conference 1967, R.C. Bose and T.A. Downling eds., Univ. North Carolina Press, 104–127, 1969
1969
Earlier work this paper cites.
R.T. Rockafeller, Network flows and Monotropic Optimization , Wiley-Interscience, 1984
1984
Earlier work this paper cites.
P. Berman, N. Kovoor and P.M. Pardalos, Algorithms for least distance problem , Complexity in Numerical Optimization, P.M. Pardalos ed., World Scientific, 33–56, 1993
1993
Earlier work this paper cites.
D.P. Bertsekas, Nonlinear Programming , Athena Scientific, 1999
1999
Earlier work this paper cites.
J.C. Platt, Fast training of support vector machines using sequential minimal optimization , Advances in Kernel Methods: Support Vector Learning, MIT Press, 1999
1999
Earlier work this paper cites.
S. Chen, D. Donoho and M. Saunders, Atomic decomposition by basis pursuit , SIAM Review, 43, 129–159, 2001
2001
Earlier work this paper cites.
D.P. Bertsekas, Parallel and Distributed Computation: Numerical Methods , Athena Scientific, 2003
2003
Earlier work this paper cites.
M.C. Ferris and T.S. Munson, Interior-point methods for massive support vector machines , SIAM Journal of Optimization, 13 (3), 783–804, 2003
2003
Earlier work this paper cites.
S. Xu, M. Freund R and J. Sun, Solution methodologies for the smallest enclosing circle problem , Computational Optimization and Applications, 25(1-3), 283–292, 2003
2003
Earlier work this paper cites.
Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course , Kluwer, 2004
2004
Earlier work this paper cites.
N. List and H.U. Simon, General polynomial time decomposition algorithms , Lecture Notes in Computer Science, vol. 3559, Springer, 308–322, 2005
2005
Earlier work this paper cites.
E. Candes, J. Romberg and T. Tao, Robust Uncertainty principles: Exact signal reconstruction from highly incomplete frequency information , IEEE Transactions on Information Theory, 52, 489–509, 2006
2006
Cited alongside, same era.
Y.H. Dai and R. Fletcher, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds , Mathematical Programming, 106 (3), 403–421, 2006
2006
Cited alongside, same era.
D. Hush, P. Kelly, C. Scovel and I. Steinwart, QP algorithms with guaranteed accuracy and run time for support vector machines , Journal of Machine Learning Research, 7, 733–769, 2006
2006
Cited alongside, same era.
L. Xiao and S. Boyd, Optimal Scaling of a gradient method for distributed resource allocation , Journal of Optimization Theory and Applications, 129, 2006
2006
Cited alongside, same era.
A. Saha and A. Tewari, On the non-asymptotic convergence of cyclic coordinate descent methods , submitted to SIAM Journal on Optimization, 2010
2010
Later among the works it cites.
P. Tseng and S. Yun, A Coordinate Gradient Descent Method for Linearly Constrained Smooth Optimization and Support Vector Machines Training , Computational Optimization and Applications, 47, 179–206, 2010
2010
Later among the works it cites.
C.C. Chang and C.J. Lin, LIBSVM: a library for support vector machines , ACM Transactions on Intelligent Systems and Technology, 27, 1–27, 2011
2011
Later among the works it cites.
I. Necoara, V. Nedelcu and I. Dumitrache, Parallel and distributed optimization methods for estimation and control in networks , Journal of Process Control, 21(5), 756–766, 2011
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K.C. Kiwiel, On linear-time algorithms for the continuous quadratic knapsack problem , Journal of Optimization Theory and Applications, 134, 549–554, 2007
2007
Cited alongside, same era.
Y. Nesterov, Gradient methods for minimizing composite objective functions , Core discussion paper, 76/2007, Universite Catholique de Louvain, 2007
2007
Cited alongside, same era.
J. Judice, M. Raydan, S. Rosa and S. Santos, On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm , Numerical Algorithms, 47, 391–407, 2008
2008
Cited alongside, same era.
C.J. Lin, S. Lucidi, L. Palagi, A. Risi and M. Sciandrone, A decomposition algorithm model for singly linearly constrained problems subject to lower and upper bounds , Journal of Optimization Theory and Applications, 141, 107–126, 2009
2009
Cited alongside, same era.
P. Tseng and S. Yun, A Coordinate Gradient Descent Method for Nonsmooth Separable Minimization , Mathematical Programming, 117, 387–423, 2009
2009
Cited alongside, same era.
P. Tseng and S. Yun, A Block-Coordinate Gradient Descent Method for Linearly Constrained Nonsmooth Separable Optimization , Journal of Optimization Theory and Applications, 140, 513–535, 2009
2009
Cited alongside, same era.
Z. Qin, K. Scheinberg and D. Goldfarb, Efficient Block-coordinate Descent Algorithms for the Group Lasso , submitted, 2010
2010
Cited alongside, same era.
I. Necoara, Y Nesterov and F. Glineur, A random coordinate descent method on large optimization problems with linear constraints , Technical Report, University Politehnica Bucharest, 2011 (http://acse.pub.ro/person/ion-necoara)
2011
Later among the works it cites.
A. Beck and L. Tetruashvilli, On the convergence of block-coordinate descent type methods , submitted to Mathematical Programming, 2012
2012
Later among the works it cites.
Yu. Nesterov and S. Shpirko, Primal-dual subgradient method for huge-scale linear conic problems , Optimization Online, 2012
2012
Later among the works it cites.
Y. Nesterov, Efficiency of coordinate descent methods on huge-scale optimization problems , SIAM Journal on Optimization 22(2), 341–362, 2012
2012
Later among the works it cites.
P. Richtarik and M. Takac, Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function , Mathematical Programming, 2012
2012
Later among the works it cites.
P. Richtarik and M. Takac, Efficient serial and parallel coordinate descent methods for huge-scale truss topology design , Operations Research Proceedings, 27–32, 2012
2012
Later among the works it cites.