Fetching the paper…
Reading the bibliography…
We propose a decomposition framework for the parallel optimization of the sum of a differentiable function and a (block) separable nonsmooth, convex one.
D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods , 2nd ed. Athena Scientific Press, 1989
1989
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society. Series B (Methodological) , pp. 267–288, 1996
1996
Earlier work this paper cites.
D. Bertsekas, Nonlinear Programming . Belmont, MA, USA: Athena Scientific, 2th Ed., 1999
1999
Earlier work this paper cites.
S. K. Shevade and S. S. Keerthi, “A simple and efficient algorithm for gene selection using sparse logistic regression,” Bioinformatics , vol. 19, no. 17, pp. 2246–2253, 2003
2003
Earlier work this paper cites.
F. Facchinei and J.-S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problem . Springer-Verlag, New York, 2003
2003
Earlier work this paper cites.
M. Yuan and Y. Lin, “Model selection and estimation in regression with grouped variables,” Journal of the Royal Statistical Society: Series B (Statistical Methodology) , vol. 68, no. 1, pp. 49–67, 2006
2006
Earlier work this paper cites.
L. Meier, S. Van De Geer, and P. Bühlmann, “The group lasso for logistic regression,” Journal of the Royal Statistical Society: Series B (Statistical Methodology) , vol. 70, no. 1, pp. 53–71, 2008
2008
Earlier work this paper cites.
P. Tseng and S. Yun, “A coordinate gradient descent method for nonsmooth separable minimization,” Mathematical Programming , vol. 117, no. 1-2, pp. 387–423, 2009
2009
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM Journal on Imaging Sciences , vol. 2, no. 1, pp. 183–202, 2009
2009
Earlier work this paper cites.
Z. Qin, K. Scheinberg, and D. Goldfarb, “Efficient block-coordinate descent algorithms for the group lasso,” Mathematical Programming Computation , pp. 1–27, 2010
2010
Earlier work this paper cites.
G.-X. Yuan, K.-W. Chang, C.-J. Hsieh, and C.-J. Lin, “A comparison of optimization methods and software for large-scale l1-regularized linear classification,” The Journal of Machine Learning Research , vol. 9999, pp. 3183–3234, 2010
2010
Earlier work this paper cites.
2011
Earlier work this paper cites.
2011
Cited alongside, same era.
P. L. Bühlmann, S. A. van de Geer, and S. Van de Geer, Statistics for high-dimensional data . Springer, 2011
2011
Cited alongside, same era.
A. Rakotomamonjy, “Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms,” Signal processing , vol. 91, no. 7, pp. 1505–1526, 2011
2011
Cited alongside, same era.
S. Sra, S. Nowozin, and S. J. Wright, Eds., Optimization for Machine Learning , ser. Neural Information Processing. Cambridge, Massachusetts: The MIT Press, Sept. 2011
2011
Cited alongside, same era.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends® in Machine Learning , vol. 3, no. 1, pp. 1–122, 2011
S. J. Wright, “Accelerated block-coordinate relaxation for regularized optimization,” SIAM Journal on Optimization , vol. 22, no. 1, pp. 159–186, 2012
2012
Later among the works it cites.
D. Goldfarb, S. Ma, and K. Scheinberg, “Fast alternating linearization methods for minimizing the sum of two convex functions,” Mathematical Programming , pp. 1–34, 2012
2012
Later among the works it cites.
2012
Later among the works it cites.
2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
D. P. Bertsekas and J. N. Tsitsiklis, Neuro-Dynamic Programming . Cambridge, Massachusetts: Athena Scientific Press, May. 2011
2011
Cited alongside, same era.
Y. Nesterov, “Gradient methods for minimizing composite functions,” Mathematical Programming , pp. 1–37, 2012
2012
Cited alongside, same era.
——, “Efficiency of coordinate descent methods on huge-scale optimization problems,” SIAM Journal on Optimization , vol. 22, no. 2, pp. 341–362, 2012
2012
Cited alongside, same era.
P. Richtárik and M. Takáč, “Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function,” Mathematical Programming , pp. 1–38, 2012
2012
Cited alongside, same era.
2012
Cited alongside, same era.
Y. Xu and W. Yin, “A block coordinate descent method for multi-convex optimization with applications to nonnegative tensor factorization and completion,” DTIC Document, Tech. Rep., 2012. [Online]. Available: http://www.caam.rice.edu/ ∼ \sim optimization/bcu/multiconvex.html
2012
Cited alongside, same era.
2013
Closest in time.
I. Necoara and D. Clipici, “Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC,” Journal of Process Control , vol. 23, no. 3, pp. 243–253, 2013
2013
Closest in time.
M. Razaviyayn, M. Hong, and Z.-Q. Luo, “A unified convergence analysis of block successive minimization methods for nonsmooth optimization,” SIAM Journal on Optimization , vol. 23, no. 2, pp. 1126–1153, 2013
2013
Closest in time.
Z. Yin, P. Ming, and Y. Wotao, “Parallel and Distributed Sparse Optimization,” 2013. [Online]. Available: http://www.caam.rice.edu/ ∼ \sim optimization/disparse/
2013
Closest in time.
G. Scutari, F. Facchinei, P. Song, D. P. Palomar, and J.-S. Pang, “Decomposition by partial linearization in multiuser systems,” in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2013) , May 4-9 2013, pp. 4424–4428
2013
Closest in time.
G. Scutari, F. Facchinei, P. Song, D. Palomar, and J.-S. Pang, “Decomposition by Partial linearization: Parallel optimization of multi-agent systems,” IEEE Transactions on Signal Processing , to appear, 2013
2013
Closest in time.
F. Facchinei, S. Sagratella, and G. Scutari, “Flexible Parallel Algorithms for Big Data Optimization,” Dept. of Electrical Eng., State University of New York at Buffalo, Buffalo, NY, USA, Tech. Rep., 2013. [Online]. Available: http://www.eng.buffalo.edu/ ∼ \sim gesualdo/FSSTechRep13.pdf
2013
Closest in time.