Fetching the paper…
Reading the bibliography…
We propose a randomized nonmonotone block proximal gradient (RNBPG) method for minimizing the sum of a smooth (possibly nonconvex) function and a block-separable (possibly nonconvex nonsmooth) function.
A Nonmonotone Line Search Technique for Newton’s Method
L. Grippo, F. Lampariello, and S. Lucidi · 1986
Earlier work this paper cites.
Two point step size gradient methods
J. Barzilai and J. M. Borwein · 1988
Earlier work this paper cites.
Optimization and Nonsmooth Analysis
F. Clarke · 1990
Earlier work this paper cites.
Probability and Measure
P. Billingsley · 1995
Earlier work this paper cites.
Nonmonotone curvilinear line search methods for unconstrained optimization
M. C. Ferris, S. Lucidi, and M. Roma · 1996
Earlier work this paper cites.
Nonmonotone spectral projected gradient methods on convex sets
E. G. Birgin, J. M. Martínez, and M. Raydan · 2000
Earlier work this paper cites.
Adaptive two-pint stepsize gradient algorithm
Y. H. Dai and H. C. Zhang · 2001
Earlier work this paper cites.
Convergence of a block coordinate descent method for nondifferentiable minimization
P. Tseng · 2001
Earlier work this paper cites.
On the convergence of the coordinate descent method for convex differentiable minimization
Z. Q. Luo and P. Tseng · 2002
Earlier work this paper cites.
A nonmonotone line search technique and its application to unconstrained optimization
H. Zhang and W. Hager · 2004
Earlier work this paper cites.
Coordinate descent method for large-scale l 2 l_{2} -loss linear support vector machines
K.-W. Chang, C.-J. Hsieh, and C.-J. Lin · 2008
Earlier work this paper cites.
A dual coordinate descent method for large-scale linear SVM
C.-J. Hsieh, K.-W. Chang, C.-J. Lin, S. Keerthi, and S. Sundararajan · 2008
Earlier work this paper cites.
Probing the Pareto frontier for basis pursuit solutions
E. Van Den Berg and M. P. Friedlander · 2008
Earlier work this paper cites.
Coordinate descent algorithms for lasso penalized regression
T. Wu and K. Lange · 2008
Cited alongside, same era.
Coordinate descent optimization for l 1 l_{1} minimization with application to compressed sensing; a greedy algorithm
Y. Li and S. Osher · 2009
Cited alongside, same era.
Stochastic methods for l 1 l_{1} regularized loss minimization
S. Shalev-Shwartz and A. Tewari · 2009
Cited alongside, same era.
Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
P. Tseng and S. Yun · 2009
Cited alongside, same era.
A coordinate gradient descent method for nonsmooth separable minimization
P. Tseng and S. Yun · 2009
Cited alongside, same era.
Sparse reconstruction by separable approximation
S. J. Wright, R. Nowak, and M. Figueiredo · 2009
Parallel coordinate descent methods for big data optimization
P. Richtárik and M. Takáč · 2012
Later among the works it cites.
Proximal stochastic dual coordinate ascent
S. Shalev-Shwartz and T. Zhang · 2012
Later among the works it cites.
Block coordinate descent methods for semidefinite programming
Z. Wen, D. Goldfarb, and K. Scheinberg · 2012
Later among the works it cites.
Accelerated block-coordinate relaxation for regularized optimization
S. J. Wright · 2012
Later among the works it cites.
Iteration complexity analysis of block coordinate descent methods
M. Hong, X. Wang, M. Razaviyayn and Z.-Q. Luo · 2013
Closest in time.
On the complexity analysis of randomized block coordinate descent methods
Z. Lu and L. Xiao · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Randomized methods for linear constraints: convergence rates and conditioning
D. Leventhal and A. S. Lewis · 2010
Cited alongside, same era.
LIBSVM data: Classification, regression and multi-label
R.-E. Fan and C.-J. Lin · 2011
Cited alongside, same era.
A coordinate gradient descent method for l 1 l_{1} -regularized convex minimization
S. Yun and K.-C. Toh · 2011
Cited alongside, same era.
On the linear convergence of the alternating direction methods
M. Hong and Z.-Q. Luo · 2012
Cited alongside, same era.
An augmented Lagrangian approach for sparse principal component analysis
Z. Lu and Y. Zhang · 2012
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Cited alongside, same era.
Closest in time.
Gradient methods for minimizing composite functions
Y. Nesterov · 2013
Closest in time.
Efficient block-coordinate descent algorithms for the group lasso
Z. Qin, K. Scheinberg, and D. Goldfarb · 2013
Closest in time.
Stochastic dual coordinate ascent methods for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2013
Closest in time.
Inexact coordinate descent: complexity and preconditioning
R. Tappenden, P. Richtárik and J. Gondzio · 2013
Closest in time.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
P. Richtárik and M. Takáč · 2014
Closest in time.
Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
A. Patrascu and I. Necoara · 2015
Closest in time.