Fetching the paper…
Reading the bibliography…
This chapter is devoted to the black-box subgradient algorithms with the minimal requirements for the storage of auxiliary results, which are necessary to execute these algorithms.
In Foundations of Computer Science, 1989, 30th Annual Symposium on pp. 332–337 (1989)
Vaidya, P.M.: Speeding-up linear programming using fast matrix multiplication · 1902
Earlier work this paper cites.
Soviet Math. Doklady (1965)
Levin, A.Y.: On an algorithm for the minimization of convex functions · 1965
Earlier work this paper cites.
Journal of the Association for Computing Machinery 12
Newman, D.: Location of the maximum on unimodal surfaces · 1965
Earlier work this paper cites.
Soviet Mathematics Doklady 8
Polyak, B.: A general method of solving extremum problems · 1967
Earlier work this paper cites.
Kibernetika 3
Shor, N.Z.: Generalized gradient descent with application to block programming · 1967
Earlier work this paper cites.
USSR Computational Mathematics and Mathematical Physics 9
B.T.Polyak: Minimization of nonsmooth functionals · 1969
Earlier work this paper cites.
Priceton University, Princeton (1970)
Rockafellar, R.: Convex Analysis · 1970
Earlier work this paper cites.
Dover Books on Mathematics. Dover Publications (1973)
Brent, R.: Algorithms for Minimization Without Derivatives · 1973
Earlier work this paper cites.
In: Doklady Academii Nauk SSSR, vol. 244, pp. 1093–1096 (1979)
Khachiyan, L.G.: A polynomial algorithm in linear programming · 1979
Earlier work this paper cites.
Ekonomika i Matematicheskie Metody 15
Nemirovskii, A.: Efficient methods for large-scale convex optimization problems · 1979
Earlier work this paper cites.
Naukova Dumka (1979)
Shor, N.: Minimization of Nondifferentiable Functions · 1979
Earlier work this paper cites.
J. Wiley & Sons, New York (1983)
Nemirovsky, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization · 1983
Earlier work this paper cites.
Soviet Mathematics Doklady 27
Nesterov, Y.: A method of solving a convex programming problem with convergence rate o ( 1 / k 2 ) o(1/k^{2}) · 1983
Earlier work this paper cites.
USSR Computational Mathematics and Mathematical Physics 25
Nemirovskii, A., Nesterov, Y.: Optimal methods of smooth convex minimization · 1985
Earlier work this paper cites.
Springer-Verlag Berlin Heidelberg (1985)
Shor, N.: Minimization Methods for Non-Differentiable Functions · 1985
Earlier work this paper cites.
New York, Optimization Software (1987)
Polyak, B.: Introduction to Optimization · 1987
Earlier work this paper cites.
Moscow (1989)
Nesterov, Y.: Effective methods in nonlinear programming · 1989
Earlier work this paper cites.
SIAM J. Optim. 7
Ben-Tal, A., Nemirovski, A.: Robust truss topology design via semidefnite programming · 1997
Earlier work this paper cites.
Optimization Methods and Software 17
Demyanov, A., Demyanov, V., Malozemov, V.: Minmaxmin problems revisited · 2002
Earlier work this paper cites.
Oper. Res. Lett. 31
Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization · 2003
Earlier work this paper cites.
SIAM Journal on Optimization 15
Nemirovski, A.: Prox-method with rate of convergence o ( 1 / t ) o(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems · 2004
Earlier work this paper cites.
Mathematical Programming 103
Nesterov, Y.: Smooth minimization of non-smooth functions · 2005
Earlier work this paper cites.
Mathematical Programming 120
Nesterov, Y.: Primal-dual subgradient methods for convex problems · 2005
Earlier work this paper cites.
Mathematical Programming 140
Nesterov, Y.: Gradient methods for minimizing composite functions · 2007
Earlier work this paper cites.
SIAM J. on Optimization 19
d’Aspremont, A.: Smooth optimization with approximate gradient · 2008
Earlier work this paper cites.
SIAM Journal on Imaging Sciences 2
Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems · 2009
Cited alongside, same era.
SIAM Journal on Optimization 19
Nedić, A., Ozdaglar, A.: Approximate primal solutions and rate analysis for dual subgradient methods · 2009
Cited alongside, same era.
Operations Research Letters 38
Beck, A., Ben-Tal, A., Guttmann-Beck, N., Tetruashvili, L.: The comirror algorithm for solving nonsmooth constrained convex problems · 2010
Cited alongside, same era.
Moscow, MCCME (2010)
Nesterov, Y.: Introduction to Convex Optimization · 2010
Cited alongside, same era.
Journal of Mathematical Imaging and Vision 40
Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging · 2011
Cited alongside, same era.
Optimization for Machine Learning pp. 121–148 (2011)
Juditsky, A., Nemirovski, A., et al.: First order methods for nonsmooth convex large-scale optimization, i: general purpose methods · 2011
Bogolubsky, L., Dvurechensky, P., Gasnikov, A., Gusev, G., Nesterov, Y., Raigorodskii, A.M., Tikhonov, A., Zhukovskii, M.: Learning supervised pagerank with gradient-based and gradient-free optimization methods · 2016
Later among the works it cites.
In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pp. 9–21. ACM (2016)
Cohen, M.B., Lee, Y.T., Miller, G., Pachocki, J., Sidford, A.: Geometric median in nearly linear time · 2016
Later among the works it cites.
Mathematical Programming 160
Drori, Y., Teboulle, M.: An optimal variants of kelley’s cutting-plane method · 2016
Later among the works it cites.
Park City Mathematics Institute, Graduate Summer School Lectures (2016)
Duchi, J.: Introductory lectures on stochastic optimization · 2016
Later among the works it cites.
Journal of Optimization Theory and Applications 171
Dvurechensky, P., Gasnikov, A.: Stochastic intermediate gradient method for convex problems with stochastic inexact oracle · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Optimization for Machine Learning pp. 149–183 (2011)
Juditsky, A., Nemirovski, A., et al.: First order methods for nonsmooth convex large-scale optimization, ii: utilizing problems structure · 2011
Cited alongside, same era.
Springer Science & Business Media (2012)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation · 2012
Cited alongside, same era.
SIAM Journal on Optimization 22
Duchi, J.C., Bartlett, P.L., Wainwright, M.J.: Randomized smoothing for stochastic optimization · 2012
Cited alongside, same era.
In: S.W. Suvrit Sra Sebastian Nowozin (ed.) Optimization for Machine Learning, pp. 121–184. Cambridge, MA: MIT Press (2012)
Juditsky, A., Nemirovski, A.: First order methods for non-smooth convex large-scale optimization, i: General purpose methods · 2012
Cited alongside, same era.
Mathematical Programming 146
Nesterov, Y.: Subgradient methods for huge-scale optimization problems · 2012
Cited alongside, same era.
URL http://arxiv.org/pdf/1212.2002v2.pdf
S. Lacost-Julien, M.S., Bach, F.: A simpler approach to obtaining o ( 1 / t ) o(1/t) convergence rate for the projected stochastic subgradient method. arxiv preprint arxiv:1212.2002 (2012) · 2012
Cited alongside, same era.
Later among the works it cites.
Foundations and Trends® in Optimization 2
Hazan, E., et al.: Introduction to online convex optimization · 2016
Later among the works it cites.
Mathematical Programming 159
Lan, G.: Gradient sliding for composite optimization · 2016
Later among the works it cites.
arXiv preprint arXiv:1609.04905 (2016)
Lan, G., Ouyang, Y.: Accelerated gradient sliding for structured convex optimization · 2016
Later among the works it cites.
Http://www.mathnet.ru:8080/PresentFiles/16179/growthbm_nesterov.pdf
Nesterov, Y.: Subgradient methods for convex functions with nonstandard growth properties (2016) · 2016
Later among the works it cites.
Baimurzina, D., Gasnikov, A., Gasnikova, E., Dvurechensky, P., Ershov, E., Kubentaeva, M., Lagunovskaya, A.: Universal similar triangulars method for searching equilibriums in traffic flow distribution models · 2017
Later among the works it cites.
Mathematical Programming 165
Chen, Y., Lan, G., Ouyang, Y.: Accelerated schemes for a class of variational inequalities · 2017
Later among the works it cites.
Dvurechensky, P.: Gradient method with inexact oracle for composite non-convex optimization · 2017
Later among the works it cites.
Dvurechensky, P., Gasnikov, A., Kamzolov, D.: Universal intermediate gradient method for convex problems with inexact oracle · 2017
Later among the works it cites.
Dvurechensky, P., Gasnikov, A., Omelchenko, S., Tiurin, A.: Adaptive similar triangles method: a stable alternative to sinkhorn’s algorithm for regularized optimal transport · 2017
Later among the works it cites.
arXiv preprint arXiv:1701.03961 (2017)
Lan, G., Lee, S., Zhou, Y.: Communication-efficient algorithms for decentralized and stochastic optimization · 2017
Later among the works it cites.
Roulet, V., d’Aspremont, A.: Sharpness, restart and acceleration · 2017
Later among the works it cites.
arXiv preprint arXiv:1711.02747 (2017)
Tyurin, A., Gasnikov, A.: Fast gradient descent method for convex optimization problems with an oracle that generates a model of a function in a requested point · 2017
Later among the works it cites.
arXiv preprint arXiv:1712.00232 (2017)
Uribe, C.A., Lee, S., Gasnikov, A., Nedić, A.: Optimal algorithms for distributed optimization · 2017
Later among the works it cites.
Bayandina, A., Dvurechensky, P., Gasnikov, A., Stonyakin, F., Titov, A.: Mirror descent and convex optimization problems with non-smooth inequality constraints · 2018
Later among the works it cites.
In: Proceedings of the 32th Conference on Neural Information Processing Systems, NIPS’18 (2018)
Dvurechensky, P., Dvinskikh, D., Gasnikov, A., Uribe, C.A., Nedić, A.: Decentralize and randomize: Faster algorithm for Wasserstein barycenters · 2018
Later among the works it cites.
Dvurechensky, P., Gasnikov, A., Kroshnin, A.: Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm · 2018
Later among the works it cites.
Dvurechensky, P., Gasnikov, A., Stonyakin, F., Titov, A.: Generalized Mirror Prox: Solving variational inequalities with monotone operator, inexact oracle, and unknown Hölder parameters · 2018
Later among the works it cites.
Springer International Publishing (2018)
Nesterov, Y.: Lectures on Convex Optimization · 2018
Later among the works it cites.
SIAM Journal on Optimization 28
Tran-Dinh, Q., Fercoq, O., Cevher, V.: A smooth primal-dual optimization framework for nonsmooth composite convex minimization · 2018
Later among the works it cites.
In: 2018 IEEE 57th Annual Conference on Decision and Control (CDC) (2018)
Uribe, C.A., Dvinskikh, D., Dvurechensky, P., Gasnikov, A., Nedić, A.: Distributed computation of Wasserstein barycenters over networks · 2018
Later among the works it cites.