Primal-dual subgradient methods for minimizing uniformly convex functions

B. Polyak. Existence theorems and convergence of minimizing sequences in extremum problems with restrictions, Sov. Math. Dokl

1967

Earlier work this paper cites.

I.A. Ibragimov, Yu.V. Linnik. Independent and stationary sequences of random variables

1971

Earlier work this paper cites.

Yu. Chekanov, Yu. Nesterov, A. Vladimirov. On uniformly convex functionals, Vest. Mosk. Univ

1978

Earlier work this paper cites.

A.S. Nemirovski, D.B. Yudin, Problem complexity and method efficiency in optimization

1983

Earlier work this paper cites.

C. Zalinescu. On uniformly convex functions, J. Math. Anal. Appl,

1983

Earlier work this paper cites.

D. Azé, J.-P. Penot, Uniformly convex and uniformly smooth convex functions. Ann. Fac. Sci. Toulouse

1995

Earlier work this paper cites.

Yu. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course

2003

Earlier work this paper cites.

Yu. Nesterov. Smooth minimization of nonsmooth functions, Math. Prog. Ser A

2005

Cited alongside, same era.

Yu. Nesterov. Excessive Gap Technique in Nonsmooth Convex Minimization, SIAM J. Optim

2005

Cited alongside, same era.

Yu. Nesterov. Primal-dual subgradient methods for convex problems, Math. Program., Ser. B

2007

Cited alongside, same era.

Yu. Nesterov. Barrier subgradient method. Ciaco

2008

Cited alongside, same era.

Yu. Nesterov, J. -Ph. Vial. Confidence level solutions for stochastic programming Automatica

2008

Cited alongside, same era.

Yu. Nesterov. Accelerating the cubic regularization of Newton’s method on convex problems Math. Program. Ser. B

2008

Cited alongside, same era.

B. Nadler, N. Srebro, X. Zhou Statistical Analysis of Semi-Supervised Learning: The Limit of Infinite Unlabelled Data, NIPS 2009 Online papers

2009

Later among the works it cites.

A. Nemirovski , A. Juditsky , G. Lan , A. Shapiro, Robust Stochastic Approximation Approach to Stochastic Programming, SIAM J. Optim

2009

Later among the works it cites.

L. Xiao, Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization, ISMP 2009, Chicago, August 23-28 (2009)

2009

Later among the works it cites.

V. Lemaire, G. Pagès, Unconstrained recursive importance sampling, Ann. Appl. Probab

2010

Later among the works it cites.

M. Raginsky, A. Rakhlin. Information-based complexity, feedback and dynamics in convex programming, IEEE Trans. on Information Theory,

2011

Later among the works it cites.