Fetching the paper…
Reading the bibliography…
In this paper we analyze a family of general random block coordinate descent methods for the minimization of $\ell_0$ regularized optimization problems, i.e.
Z. Q. Luo and P. Tseng, On the convergence of the coordinate descent method for convex differentiable minimization
1992
Earlier work this paper cites.
Z.-Q. Luo and P. Tseng, Error bounds and convergence analysis of feasible descent methods: a general approach
1993
Earlier work this paper cites.
L Grippo and M. Sciandrone, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
2000
Earlier work this paper cites.
E. J. Candes and T. Tao, Near-optimal signal recovery from random projections: universal encoding strategies
2004
Earlier work this paper cites.
C.M. Bishop. Pattern recognition and machine learning
2007
Earlier work this paper cites.
O. Banerjee, L. El Ghaoui, and A. d’Aspremont, Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data
2008
Earlier work this paper cites.
T. Blumensath and M. E. Davies, Iterative thresholding for sparse approximations
2008
Earlier work this paper cites.
T. Hastie, R. Tibshirani, and J. Friedman, The elements of statistical learning: data mining, inference and prediction
2009
Earlier work this paper cites.
P. Tseng and S. Yun, A Coordinate Gradient Descent Method for Nonsmooth Separable Minimization
2009
Earlier work this paper cites.
2010
Cited alongside, same era.
M. Carlavan and L. Blanc-Feraud, Two constrained formulations for deblurring Poisson noisy images
2011
Cited alongside, same era.
N. Gillis, Sparse and unique nonnegative matrix factorization through data preprocessing
2012
Cited alongside, same era.
Y. Nesterov, Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
2012
Cited alongside, same era.
S. Bahmani, B. Raj, and P. T. Boufounos, Greedy sparsity-constrained optimization
2013
Cited alongside, same era.
A. Beck, Y.C. Eldar, Sparsity constrained nonlinear optimization: optimality conditions and algorithms
2013
Later among the works it cites.
Z. Lu and Y. Zhang, Sparse approximation via penalty decomposition methods
2013
Later among the works it cites.
I. Necoara, Random coordinate descent algorithms for multi-agent convex optimization over networks
2013
Later among the works it cites.
M. Nikolova, Description of the minimizers of least squares regularized with â0 norm. Uniqueness of the global minimizer
2013
Later among the works it cites.
2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
A. Beck and L. Tetruashvili, On the convergence of block coordinate descent type methods
2013
Cited alongside, same era.
V. Kekatos and G. Giannakis, Distributed robust power system state estimation
2013
Cited alongside, same era.
Z. Lu, Iterative hard thresholding methods for ℓ 0 \ell_{0} regularized convex cone programming
2013
Cited alongside, same era.
I. Necoara, A. Patrascu, Q. Tran-Dinh and V. Cevher, Linear convergence of a family of random coordinate descent algorithms for strongly convex composite minimization
2014
Closest in time.
A. Patrascu and I. Necoara, Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
2014
Closest in time.
P. Richtarik and M. Takac, Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
2014
Closest in time.