Fetching the paper…
Reading the bibliography…
We describe a convergence acceleration technique for unconstrained optimization problems.
Aitken, A. C. [1927], Proceedings of the Royal Society of Edinburgh
1927
Earlier work this paper cites.
Levinson, N. [1949], ‘The wiener rms error criterion in filter design and prediction, appendix b of wiener, n.(1949)’, Extrapolation, Interpolation, and Smoothing of Stationary Time Series
1949
Earlier work this paper cites.
Shanks, D. [1955], ‘Non-linear transformations of divergent and slowly convergent sequences’, Studies in Applied Mathematics
1955
Earlier work this paper cites.
Wynn, P. [1956], ‘On a device for computing the e m (s n) transformation’, Mathematical Tables and Other Aids to Computation
1956
Earlier work this paper cites.
Durbin, J. [1960], ‘The fitting of time-series models’, Revue de l’Institut International de Statistique
1960
Earlier work this paper cites.
Golub, G. H. and Varga, R. S. [1961], ‘Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order richardson iterative methods’, Numerische Mathematik
1961
Earlier work this paper cites.
Anderson, D. G. [1965], ‘Iterative procedures for nonlinear integral equations’, Journal of the ACM (JACM)
1965
Earlier work this paper cites.
Cabay, S. and Jackson, L. [1976], ‘A polynomial extrapolation method for finding limits and antilimits of vector sequences’, SIAM Journal on Numerical Analysis
1976
Earlier work this paper cites.
Mešina, M. [1977], ‘Convergence acceleration for the iterative solution of the equations x= ax+ f’, Computer Methods in Applied Mechanics and Engineering
1977
Earlier work this paper cites.
Eddy, R. [1979], ‘Extrapolating to the limit of a vector sequence’, Information linkage between applied mathematics and industry
1979
Earlier work this paper cites.
Nesterov, Y. [1983], A method of solving a convex programming problem with convergence rate o (1/k2), in
1983
Earlier work this paper cites.
Nemirovskiy, A. S. and Polyak, B. T. [1984], ‘Iterative methods for solving linear ill-posed problems under precise information.’, ENG. CYBER
1984
Cited alongside, same era.
Nemirovskii, A. and Nesterov, Y. E. [1985], ‘Optimal methods of smooth convex minimization’, USSR Computational Mathematics and Mathematical Physics
1985
Cited alongside, same era.
Sidi, A., Ford, W. F. and Smith, D. A. [1986], ‘Acceleration of convergence of vector sequences’, SIAM Journal on Numerical Analysis
1986
Cited alongside, same era.
Smith, D. A., Ford, W. F. and Sidi, A. [1987], ‘Extrapolation methods for vector sequences’, SIAM review
1987
Cited alongside, same era.
Tyrtyshnikov, E. E. [1994], ‘How bad are hankel matrices?’, Numerische Mathematik
1994
Cited alongside, same era.
Heinig, G. and Rost, K. [2011], ‘Fast algorithms for toeplitz and hankel matrices’, Linear Algebra and its Applications
2011
Later among the works it cites.
Hardt, M. [2013], ‘The zen of gradient descent’
2013
Later among the works it cites.
Nesterov, Y. [2013], Introductory lectures on convex optimization: A basic course
2013
Later among the works it cites.
Drori, Y. and Teboulle, M. [2014], ‘Performance of first-order methods for smooth convex minimization: a novel approach’, Mathematical Programming
2014
Later among the works it cites.
Hazan, E. [2014], ‘Personal communication’
2014
Later among the works it cites.
Su, W., Boyd, S. and Candes, E. [2014], in
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Nesterov, Y. [2000], Squared functional systems and optimization problems, in
2000
Cited alongside, same era.
Parrilo, P. A. [2000], Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization, PhD thesis, California Institute of Technology
2000
Cited alongside, same era.
Ben-Tal, A. and Nemirovski, A. [2001], Lectures on modern convex optimization: analysis, algorithms, and engineering applications
2001
Cited alongside, same era.
Lasserre, J. B. [2001], ‘Global optimization with polynomials and the problem of moments’, SIAM Journal on Optimization
2001
Cited alongside, same era.
Brezinski, C. [2006], Accélération de la convergence en analyse numérique
2006
Cited alongside, same era.
Beck, A. and Teboulle, M. [2009], ‘A fast iterative shrinkage-thresholding algorithm for linear inverse problems’, SIAM journal on imaging sciences
2009
Cited alongside, same era.
Lin, H., Mairal, J. and Harchaoui, Z. [2015], A universal catalyst for first-order optimization, in
2015
Later among the works it cites.
Nesterov, Y. [2015], ‘Universal gradient methods for convex optimization problems’, Mathematical Programming
2015
Later among the works it cites.
2015
Later among the works it cites.
Lessard, L., Recht, B. and Packard, A. [2016], ‘Analysis and design of optimization algorithms via integral quadratic constraints’, SIAM Journal on Optimization
2016
Closest in time.