A universal modification of the linear coupling method

A. Nemirovskii and D.B. Yudin, Problem complexity and method efficiency in optimization (1983)

1983

Earlier work this paper cites.

A.S. Nemirovski and Y.E. Nesterov, Optimal methods of smooth convex minimization , Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki 25 (1985), pp. 356–369

1985

Earlier work this paper cites.

B.T. Polyak, Introduction to optimization. 1987 , Optimization Software, Inc, New York

1987

Earlier work this paper cites.

Y. Nesterov, Effective methods in nonlinear programming , Radio and communication, 1989 (in Russian)

1989

Earlier work this paper cites.

G. Narkiss and M. Zibulevsky, Sequential subspace optimization method for large-scale unconstrained problems , Technion-IIT, Department of Electrical Engineering, 2005

2005

Cited alongside, same era.

Z. Allen-Zhu and L. Orecchia, Linear coupling: An ultimate unification of gradient and mirror descent , arXiv preprint arXiv:1407.1537 (2014)

Original

2014

Cited alongside, same era.

O. Devolder, F. Glineur, and Y. Nesterov, First-order methods of smooth convex optimization with inexact oracle , Mathematical Programming 146 (2014), pp. 37–75, Available at https://doi.org/10.1007/s10107-013-0677-5

2014

Cited alongside, same era.

Y. Nesterov, Universal gradient methods for convex optimization problems , Mathematical Programming 152 (2015), pp. 381–404

2015

Cited alongside, same era.

A. Gasnikov and Y. Nesterov, Universal fast gradient method for stochastic composit optimization problems , arXiv preprint arXiv:1604.05275 (2016)

Original

2016

Later among the works it cites.

A. Anikin, A. Gasnikov, P. Dvurechensky, A. Tyurin, and A. Chernov, Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints , Computational Mathematics and Mathematical Physics 57 (2017), pp. 1262–1276

2017

Closest in time.

P. Dvurechensky, A. Gasnikov, and A. Tiurin, Randomized similar triangles method: A unifying framework for accelerated randomized optimization methods (coordinate descent, directional search, derivative-free method) , arXiv preprint arXiv:1707.08486 (2017)

Original

2017

Closest in time.

Y. Drori and A.B. Taylor, Efficient first-order methods for convex minimization: a constructive approach , arXiv preprint arXiv:1803.05676 (2018)

Original

2018

Closest in time.