Primal-dual accelerated gradient methods with small-dimensional relaxation oracle

D. Kim and J.A. Fessler, Generalizing the optimized gradient method for smooth convex minimization , SIAM Journal on Optimization 28 (2018), pp. 1920–1950

1950

Earlier work this paper cites.

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

1983

Earlier work this paper cites.

A. Nemirovsky and D. Yudin, Problem Complexity and Method Efficiency in Optimization , J. Wiley & Sons, New York, 1983

1983

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 27 (1983), pp. 372–376

1983

Earlier work this paper cites.

Y.E. Nesterov, Effective methods in nonlinear programming , Moscow, Radio i Svyaz (1989)

1989

Earlier work this paper cites.

A. Nemirovsky, Information-based complexity of linear operator equations , Journal of Complexity 8 (1992), pp. 153–175

1992

Earlier work this paper cites.

M. Haarala, K. Miettinen, and M.M. Mäkelä, New limited memory bundle method for large-scale nonsmooth optimization , Optimization Methods and Software 19 (2004), pp. 673–692

2004

Earlier work this paper cites.

Y. Nesterov, Introductory Lectures on Convex Optimization: a basic course , Kluwer Academic Publishers, Massachusetts, 2004

2004

Earlier work this paper cites.

Y. Nesterov, Introductory lectures on convex optimization. applied optimization, vol. 87 (2004)

2004

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

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

Earlier work this paper cites.

Y. Nesterov, Smooth minimization of non-smooth functions , Mathematical Programming 103 (2005), pp. 127–152

2005

Cited alongside, same era.

J. Nocedal and S.J. Wright, Numerical Optimization , 2nd ed., Springer, New York, NY, USA, 2006

2006

Cited alongside, same era.

Y. Nesterov, Gradient methods for minimizing composite functions , Mathematical Programming 140 (2013), pp. 125–161. First appeared in 2007 as CORE discussion paper 2007/76

2007

Cited alongside, same era.

N. Andrei, 40 conjugate gradient algorithms for unconstrained optimization. a survey on their definition , 2008. https://camo.ici.ro/neculai/p13a08.pdf

2008

Cited alongside, same era.

A. Beck and M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems , SIAM Journal on Imaging Sciences 2 (2009), pp. 183–202. Available at https://doi.org/10.1137/080716542

Y. Nesterov, Universal gradient methods for convex optimization problems , Mathematical Programming 152 (2015), pp. 381–404. Available at http://dx.doi.org/10.1007/s10107-014-0790-0

2015

Later among the works it cites.

A. Yurtsever, Q. Tran-Dinh, and V. Cevher, A Universal Primal-dual Convex Optimization Framework , in Proceedings of the 28th International Conference on Neural Information Processing Systems , Cambridge, MA, USA. MIT Press, NIPS’15, 2015, pp. 3150–3158

2015

Later among the works it cites.

A. Chernov, P. Dvurechensky, and A. Gasnikov, Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints , in Discrete Optimization and Operations Research: 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings , Y. Kochetov, M. Khachay, V. Beresnev, E. Nurminski, and P. Pardalos, eds. Springer International Publishing, 2016, pp. 391–403

2016

Later among the works it cites.