Global convergence of the Heavy-ball method for convex optimization

M. R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems . National Bureau of Standards Washington, DC, 1952

1952

Earlier work this paper cites.

M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval research logistics quarterly , vol. 3, pp. 95–110, 1956

1956

Earlier work this paper cites.

K. J. Arrow, Studies in Linear and Non-linear Programming . Stanford mathematical studies in the social sciences, 1958

1958

Earlier work this paper cites.

B. T. Polyak, “Some methods of speeding up the convergence of iteration methods,” USSR Computational Mathematics and Mathematical Physics , vol. 4, no. 5, pp. 1–17, 1964

1964

Earlier work this paper cites.

Y. Nesterov, “A method of solving a convex programming problem with convergence rate O ⁡ ( 1 / k 2 ) O(1/k^{2}) ,” Soviet Mathematics Doklady , vol. 27, pp. 372–376, 1983

1983

Earlier work this paper cites.

A. Nemirovsky and D. Yudin, Problem complexity and method efficiency in optimization Problem , ser. Interscience Series in Discrete Mathematics. John Wiley, 1983

1983

Earlier work this paper cites.

——, Introduction to Optimization . Optimization Software, 1987

1987

Earlier work this paper cites.

S. Zavriev and F. Kostyuk, “Heavy-ball method in nonconvex optimization problems,” Computational Mathematics and Modeling , vol. 4, no. 4, pp. 336–341, 1993

1993

Earlier work this paper cites.

R. T. Rockafellar and R. J.-B. Wets, Variational analysis . Springer, 1998, vol. 317

1998

Cited alongside, same era.

Y. Nesterov, Introductory lectures on convex optimization: A basic course . Springer, 2004

2004

Cited alongside, same era.

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

Cited alongside, same era.

O. Devolder, F. Glineur, and Y. Nesterov, “First-order methods of smooth convex optimization with inexact oracle,” Mathematical Programming , pp. 1–39, 2013

2013

Cited alongside, same era.

E. Ghadimi, I. Shames, and M. Johansson, “Multi-step gradient methods for networked optimization,” IEEE Transactions on Signal Processing , vol. 61, no. 21, pp. 5417–5429, Nov 2013

2013

Cited alongside, same era.

Y. Drori and M. Teboulle, “Performance of first-order methods for smooth convex minimization: a novel approach,” Mathematical Programming, Series A , vol. 145, pp. 451–482, 2014

2014

Closest in time.

Q. Lin, Z. Lu, and L. Xiao, “An Accelerated Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization,” ArXiv e-prints , Jul. 2014

2014

Closest in time.

I. Necoara and V. Nedelcu, “Rate analysis of inexact dual first-order methods application to dual decomposition,” Automatic Control, IEEE Transactions on , vol. 59, no. 5, pp. 1232–1243, May 2014

2014

Closest in time.

P. Ochs, T. Brox, and T. Pock, “iPiasco: Inertial proximal algorithm for strongly convex optimization,” Technical Report , 2014. [Online]. Available: http://lmb.informatik.uni-freiburg.de//Publications/2014/OB14a

2014

Closest in time.