Fetching the paper…
Reading the bibliography…
The most popular first-order accelerated black-box methods for solving large-scale convex optimization problems are the Fast Gradient Method (FGM) and the Fast Iterative Shrinkage Thresholding Algorithm (FISTA).
J. M. Ortega and W. C. Rheinboldt, Iterative solution of nonlinear equations in several variables . Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1970
1970
Earlier work this paper cites.
R. T. Rockafellar, Convex Analysis . Princeton University Press, Princeton, NJ, USA, 1970
1970
Earlier work this paper cites.
A. Nemirovski and D.-B. Yudin, Problem complexity and method efficiency in optimization . John Wiley & Sons, New York, NY, USA, 1983
1983
Earlier work this paper cites.
——, “A method of solving a convex programming problem with convergence rate 𝒪 ( 1 / k 2 ) \mathcal{O}(1/k^{2}) ,” Dokl. Math. , vol. 27, no. 2, pp. 372–376, 1983
1983
Earlier work this paper cites.
B. Polyak, Introduction to optimization (translated from Russian) . Translations Series in Mathematics and Engineering, Optimization Software, New York, NY, USA, 1987
1987
Earlier work this paper cites.
A. Brown and M. C. Bartholomew-Biggs, “Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations,” J. Optim. Theory Appl , vol. 62, no. 2, pp. 211–224, 1989
1989
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. R. Stat. Soc. Ser. B. Methodol. , vol. 58, no. 1, pp. 267–288, 1996
1996
Earlier work this paper cites.
——, Introductory Lectures on Convex Optimization. Applied Optimization, vol. 87 . Kluwer Academic Publishers, Boston, MA, USA, 2004
2004
Earlier work this paper cites.
H. Zou and T. Hastie, “Regularization and variable selection via the elastic net,” J. R. Stat. Soc. Ser. B. Methodol. , vol. 67, no. 2, pp. 301–320, 2005
2005
Earlier work this paper cites.
Y. Nesterov, “Gradient methods for minimizing composite functions,” Université catholique de Louvain, CORE Discussion Papers , 2007/76, Sep. 2007
2007
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J. Imaging Sci. , vol. 2, no. 1, pp. 183–202, 2009
2009
Earlier work this paper cites.
S. J. Wright, R. D. Nowak, and M. A. Figueiredo, “Sparse reconstruction by separable approximation,” IEEE Trans. Signal Process. , vol. 57, no. 7, pp. 2479–2493, 2009
2009
Earlier work this paper cites.
A. Beck and M. Teboulle, “Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems,” IEEE Trans. Image Process. , vol. 18, no. 11, pp. 2419–2434, 2009
2009
Earlier work this paper cites.
Z. Wen, W. Yin, D. Goldfarb, and Y. Zhang, “A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation,” SIAM J. Sci. Comput. , vol. 32, no. 4, pp. 1832–1857, 2010
2010
Cited alongside, same era.
S. R. Becker, E. J. Candès, and M. C. Grant, “Templates for convex cone problems with applications to sparse signal recovery,” Math. Program. Comput. , vol. 3, no. 3, pp. 165–218, 2011
2011
Cited alongside, same era.
M. Yamagishi and I. Yamada, “Over-relaxation of the fast iterative shrinkage-thresholding algorithm with variable stepsize,” Inverse Problems , vol. 27, no. 10, p. 105008, Sep. 2011
2011
Cited alongside, same era.
W. W. Hager, D. T. Phan, and H. Zhang, “Gradient-based methods for sparse recovery,” SIAM J. Imaging Sci. , vol. 4, no. 1, pp. 146–165, 2011
2011
Cited alongside, same era.
S. Bubeck et al. , “Convex optimization: Algorithms and complexity,” Found. Trends Mach. Learn. , vol. 8, no. 3-4, pp. 231–357, 2015
2015
Later among the works it cites.
H. Lin, J. Mairal, and Z. Harchaoui, “A universal catalyst for first-order optimization,” in NIPS , Dec. 2015, Montreal, Canada, pp. 3384–3392
2015
Later among the works it cites.
B. O’Donoghue and E. Candès, “Adaptive restart for accelerated gradient schemes,” Found. Comput. Math. , vol. 15, no. 3, pp. 715–732, 2015
2015
Later among the works it cites.
A. Chambolle and C. Dossal, “On the convergence of the iterates of the Fast Iterative Shrinkage/Thresholding Algorithm,” J. Optim. Theory Appl , vol. 166, no. 3, pp. 968–982, 2015
2015
Later among the works it cites.
T. Hastie, R. Tibshirani, and M. Wainwright, Statistical Learning with Sparsity: The Lasso and Generalizations . CRC Press, 2015
2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Found. Trends Mach. Learn. , vol. 3, no. 1, pp. 1–122, 2011
2011
Cited alongside, same era.
J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach , 5th ed. Morgan Kaufmann Publishers, San Francisco, CA, USA, 2011
2011
Cited alongside, same era.
Z. Wen, W. Yin, H. Zhang, and D. Goldfarb, “On the convergence of an active-set method for l 1 l_{1} minimization,” Optim. Methods Software , vol. 27, no. 6, pp. 1127–1146, 2012
2012
Cited alongside, same era.
Y. Nesterov, “Subgradient methods for huge-scale optimization problems,” Math. Program., Ser. A , vol. 146, no. 1-2, pp. 275–297, 2014
2014
Cited alongside, same era.
N. Parikh, S. P. Boyd et al. , “Proximal algorithms,” Found. Trends Optim. , vol. 1, no. 3, pp. 127–239, 2014
2014
Cited alongside, same era.
K. Slavakis, G. B. Giannakis, and G. Mateos, “Modeling and optimization for big data analytics:(statistical) learning tools for our era of data deluge,” IEEE Signal Process. Mag. , vol. 31, no. 5, pp. 18–31, Sep. 2014
2014
Cited alongside, same era.
J. Mairal, “Optimization with first-order surrogate functions,” in ICML , 2014, Atlanta, Georgia, USA, pp. 73–81
2014
Cited alongside, same era.
Q. Lin and L. Xiao, “An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization,” in ICML , 2014, pp. 73–81
2014
Cited alongside, same era.
Later among the works it cites.
A. Chambolle and T. Pock, “An introduction to continuous optimization for imaging,” Acta Numer. , vol. 25, pp. 161–319, 2016
2016
Later among the works it cites.
Y. Nesterov and S. Stich, “Efficiency of accelerated coordinate descent method on structured optimization problems,” Université catholique de Louvain, CORE Discussion Papers , 2016/03, Feb. 2016
2016
Later among the works it cites.
K. Lange, MM optimization algorithms . Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2016
2016
Later among the works it cites.
W. Su, S. Boyd, and E. J. Candès, “A differential equation for modeling Nesterov’s accelerated gradient method: Theory and insights,” J. Mach. Learn. Res. , vol. 17, pp. 1–43, 2016
2016
Later among the works it cites.
M. I. Florea and S. A. Vorobyov, “A robust FISTA-like algorithm,” in Proc. of IEEE Intern. Conf. on Acoustics, Speech and Signal Processing (ICASSP) , Mar. 2017, New Orleans, USA, pp. 4521–4525
2017
Closest in time.
M. I. Florea, “Constructing accelerated algorithms for large-scale optimization,” Ph.D. dissertation, Aalto University, School of Electrical Engineering, Helsinki, Finland, Oct. 2018
2018
Closest in time.
——, “An accelerated composite gradient method for large-scale composite objective problems,” IEEE Trans. Signal Process. , vol. 67, no. 2, pp. 444–459, Jan. 2019
2019
Closest in time.