Fetching the paper…
Reading the bibliography…
Block-coordinate descent algorithms and alternating minimization methods are fundamental optimization algorithms and an important primitive in large-scale optimization and machine learning.
Iterative solution of nonlinear equations in several variables , volume 30
Ortega, James M and Rheinboldt, Werner C · 1970
Earlier work this paper cites.
Nonlinear programming
Bertsekas, Dimitri P · 1999
Earlier work this paper cites.
Convex optimization
Boyd, Stephen and Vandenberghe, Lieven · 2004
Earlier work this paper cites.
A Randomized Kaczmarz Algorithm with Exponential Convergence
Strohmer, Thomas and Vershynin, Roman · 2009
Earlier work this paper cites.
A coordinate gradient descent method for nonsmooth separable minimization
Tseng, Paul and Yun, Sangwoon · 2009
Earlier work this paper cites.
Robust statistics: the approach based on influence functions , volume 196
Hampel, Frank R, Ronchetti, Elvezio M, Rousseeuw, Peter J, and Stahel, Werner A · 2011
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Nesterov, Yu · 2012
Earlier work this paper cites.
On the convergence of block coordinate descent type methods
Beck, Amir and Tetruashvili, Luba · 2013
Earlier work this paper cites.
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
Lee, Yin Tat and Sidford, Aaron · 2013
Earlier work this paper cites.
UCI machine learning repository, 2013
Lichman, M · 2013
Cited alongside, same era.
On the nonasymptotic convergence of cyclic coordinate descent methods
Saha, Ankan and Tewari, Ambuj · 2013
Cited alongside, same era.
Theory of Convex Optimization for Machine Learning
Bubeck, Sébastien · 2014
Cited alongside, same era.
Feedback prediction for blogs
Buza, Krisztian · 2014
Cited alongside, same era.
An accelerated proximal coordinate gradient method
Lin, Qihang, Lu, Zhaosong, and Xiao, Lin · 2014
Cited alongside, same era.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Richtárik, Peter and Takáč, Martin · 2014
Cited alongside, same era.
Improved iteration complexity bounds of cyclic block coordinate descent for convex problems
Sun, Ruoyu and Hong, Mingyi · 2015
Later among the works it cites.
Coordinate descent algorithms
Wright, Stephen J · 2015
Later among the works it cites.
Even faster accelerated coordinate descent using non-uniform sampling
Allen-Zhu, Zeyuan, Qu, Zheng, Richtárik, Peter, and Yuan, Yang · 2016
Later among the works it cites.
Coordinate descent with arbitrary sampling i: Algorithms and complexity
Qu, Zheng and Richtárik, Peter · 2016
Later among the works it cites.
SDNA: Stochastic dual Newton ascent for empirical risk minimization
Qu, Zheng, Richtárik, Peter, Takáč, Martin, and Fercoq, Olivier · 2016
Later among the works it cites.
The approximate duality gap technique: A unified theory of first-order methods, 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
Beck, Amir · 2015
Cited alongside, same era.
Accelerated, parallel, and proximal coordinate descent
Fercoq, Olivier and Richtárik, Peter · 2015
Cited alongside, same era.
Stochastic dual ascent for solving linear systems
Gower, Robert Mansel and Richtárik, Peter · 2015
Cited alongside, same era.
Diakonikolas, Jelena and Orecchia, Lorenzo · 2017
Later among the works it cites.
Efficiency of the accelerated coordinate descent method on structured optimization problems
Nesterov, Yurii and Stich, Sebastian U · 2017
Later among the works it cites.
Accelerated alternating minimization
Guminov, Sergey, Dvurechensky, Pavel, and Gasnikov, Alexander · 2019
Closest in time.