Fetching the paper…
Reading the bibliography…
Coordinate descent algorithms solve optimization problems by successively performing approximate minimization along coordinate directions or coordinate hyperplanes.
Bulletin International de l’Academie Polonaise des Sciences et des Lettres 35
Kaczmarz, S.: Angenäherte auflösung von systemen linearer gleichungen · 1937
Earlier work this paper cites.
Academic Press, New York and London (1970)
Ortega, J.M., Rheinboldt, W.C.: Iterative solution of nonlinear equations in several variables · 1970
Earlier work this paper cites.
Princeton University Press, Princeton, N.J. (1970)
Rockafellar, R.T.: Convex Analysis · 1970
Earlier work this paper cites.
Mathematical Programming 4
Powell, M.J.D.: On search directions for minimization algorithms · 1973
Earlier work this paper cites.
Doklady AN SSSR 269
Nesterov, Y.: A method for unconstrained convex problem with the rate of convergence O ( 1 / k 2 ) O(1/k^{2}) · 1983
Earlier work this paper cites.
Optimization Software (1987)
Polyak, B.T.: Introduction to Optimization · 1987
Earlier work this paper cites.
Prentice-Hall, Inc., Englewood Cliffs, New Jersey (1989)
Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods · 1989
Earlier work this paper cites.
Mathematical Programming 55
Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators · 1992
Earlier work this paper cites.
Journal of Optimization Theory and Applications 72
Luo, Z.Q., Tseng, P.: On the convergence of the coordinate descent method for convex differentiable minimization · 1992
Earlier work this paper cites.
Annals of Operations Research 46
Luo, Z.Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach · 1993
Earlier work this paper cites.
International Transactions on Operational Research 2
Florian, M., Chen, Y.: A coordinate descent method for the bilevel O-D matrix adjustment problem · 1995
Earlier work this paper cites.
IEEE Transactions on Image Processing 5
Bouman, C.A., Sauer, K.: A unified approach to statistical tomography using coordinate descent optimization · 1996
Earlier work this paper cites.
Journal of the Royal Statistical Society B 58
Tibshirani, R.: Regression shrinkage and selection via the LASSO · 1996
Earlier work this paper cites.
Athena Scientific (1999)
Bertsekas, D.P.: Nonlinear Programming, second edn · 1999
Earlier work this paper cites.
In: B. Schölkopf, C.J.C. Burges, A.J. Smola (eds.) Advances in Kernel Methods — Support Vector Learning, pp. 185–208. MIT Press, Cambridge, MA (1999)
Platt, J.C.: Fast training of support vector machines using sequential minimal optimization · 1999
Earlier work this paper cites.
Journal of the Optical Society of America A 16
Ye, J.C., Webb, K.J., Bouman, C.A., Millane, R.P.: Optical diffusion tomography by iterative-coordinate-descent optimization in a bayesian framework · 1999
Earlier work this paper cites.
Journal of Computational and Graphical Statistics 9
Sardy, S., Bruce, A., Tseng, P.: Block coordinate relaxation methods for nonparametric wavelet denoising · 2000
Earlier work this paper cites.
Journal of Optimization Theory and Applications 109
Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization · 2001
Earlier work this paper cites.
Protein Science 12
Canutescu, A.A., Dunbrack, R.L.: Cyclic coordinate descent: A robotics algorithm for protein loop closure · 2003
Earlier work this paper cites.
Kluwer Academic Publishers (2004)
Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course · 2004
Cited alongside, same era.
Journal of Machine Learning Research 9
Chang, K., Hsieh, C., Lin, C.: Coordinate descent method for large-scale l2-loss linear support vector machines · 2008
Cited alongside, same era.
Biostatistics 9
Friedman, J., Hastie, T., Tibshirani, R.: Sparse inverse covariance estimation with the graphical lasso · 2008
Cited alongside, same era.
SIAM Journal on Imaging Sciences 2
Beck, A., Teboulle, M.: A fast iterative shrinkage-threshold algorithm for linear inverse problems · 2009
Cited alongside, same era.
In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML ’09, pp. 649–656. ACM, New York, NY, USA (2009)
Liu, H., Palatucci, M., Zhang, J.: lockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery · 2009
Cited alongside, same era.
Journal of Fourier Analysis and Applications 15
SIAM Journal on Optimization 23
Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent methods · 2013
Later among the works it cites.
Technical Report arXiv:1312.5799, School of Mathematics, University of Edinburgh (2013)
Fercoq, O., Richtarik, P.: Accelerated, parallel, and proximal coordinate descent · 2013
Later among the works it cites.
In: 54th Annual Symposium on Foundations of Computer Science, pp. 147–156 (2013)
Lee, Y.T., Sidford, A.: Efficient accelerated coordinate descent methods and faster algorihtms for solving linear systems · 2013
Later among the works it cites.
Liu, J., Wright, S.J., Ré, C., Bittorf, V., Sridhar, S.: An asynchronous parallel stochastic coordinate descent algorithm · 2013
Later among the works it cites.
Technical Report arXiv 1310.2887, Computer Sciences Department, University of Wisconsin-Madison (2013)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence · 2009
Cited alongside, same era.
Mathematical Programming, Series B 117
Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization · 2009
Cited alongside, same era.
Mathematics of Operations Research 35
Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the kurdyka-lojasiewicz inequality · 2010
Cited alongside, same era.
Journal of Statitsical Software 33
Friedman, J.H., Hastie, T., Tibshirani, R.: Regularization paths for generalized linear models via coordinate descent · 2010
Cited alongside, same era.
Mathematics of Operations Research (2010)
Leventhal, D., Lewis, A.S.: Randomized methods for linear constraints: Convergence rates and conditioning · 2010
Cited alongside, same era.
SIAM Review 52
Recht, B., Fazel, M., Parrilo, P.: Guaranteed minimum-rank solutions to linear matrix equations via nuclear norm minimization · 2010
Cited alongside, same era.
Foundations and Trends in Machine Learning 3
Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction methods of multipliers · 2011
Cited alongside, same era.
Liu, J., Wright, S.J., Sridhar, S.: An accelerated randomized Kaczmarz algorithm · 2013
Later among the works it cites.
Technical Report 1-41, University Politehnica Bucharest (2013)
Necoara, I., Clipici, D.: Distributed random coordinate descent method for composite minimization · 2013
Later among the works it cites.
Journal of Global Optimization (2013)
Patrascu, A., Necoara, I.: Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization · 2013
Later among the works it cites.
SIAM Journal on Optimization 23
Razaviyayn, M., Hong, M., Luo, Z.Q.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization · 2013
Later among the works it cites.
Technical Report arXiv:1212.0873, School of Mathematics, University of Edinburgh (2013)
Richtarik, P., Takac, M.: Parallel coordinate descent methods for big data optimization · 2013
Later among the works it cites.
Journal of Machine Learning Research 14
Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent mehods for regularized loss minimization · 2013
Later among the works it cites.
Mathematical Programming, Series A 146
Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems · 2014
Later among the works it cites.
Technical report, RUTCOR, Rutgers University (2014)
Eckstein, J., Yao, W.: Understanding the convergence of the alternating direction method of multipliers: Theoretical and computational perspectives · 2014
Later among the works it cites.
Fercoq, O., Qu, Z., Richtarik, P., Takac, M.: Fast distributed coordinate descent for non-strongly convex losses · 2014
Later among the works it cites.
Advances in Neural Information Processing Systems 27
Jaggi, M., Smith, V., Takác, M., Terhorst, J., Krishnan, S., Hoffman, T., Jordan, M.I.: Communication-efficient distributed dual coordinate ascent · 2014
Later among the works it cites.
Technical Report arXiv:1407.1296, Microsoft Research (2014)
Lin, Q., Lu, Z., Xiao, L.: An accelerated proximal coordinate gradient method and its application to empirical risk minimization · 2014
Later among the works it cites.
Technical Report arXiv:1403.3862, University of Wisconsin, Madison (2014)
Liu, J., Wright, S.J.: Asynchronous stochastic coordinate descent: Parallelism and convergence properties · 2014
Later among the works it cites.
Technical Report arXiv:1406.0238 (2014)
Marecek, J., Richtarik, P., Takac, M.: Distributed block coordinate descent for minimizing partially separable functions · 2014
Later among the works it cites.
Mathematical Programming, Series A 146
Nesterov, Y.: Subgradient methods for huge-scale optimization problems · 2014
Later among the works it cites.
Mathematical Programming, Series A 144
Richtarik, P., Takac, M.: Iteration complexity of a randomized block-coordinate descent methods for minimizing a composite function · 2014
Later among the works it cites.