Fetching the paper…
Reading the bibliography…
First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years.
1901
Earlier work this paper cites.
1902
Earlier work this paper cites.
1902
Earlier work this paper cites.
1902
Earlier work this paper cites.
1906
Earlier work this paper cites.
1910
Earlier work this paper cites.
1910
Earlier work this paper cites.
1911
Earlier work this paper cites.
1911
Earlier work this paper cites.
1912
Earlier work this paper cites.
R. Sun, Optimization for deep learning: theory and algorithms, arXiv preprint arXiv:1912.08957
1912
Earlier work this paper cites.
H. Robbins, S. Monro, A stochastic approximation method, The Annals of Mathematical Statistics 22 (3) (1951) 400–407
1951
Earlier work this paper cites.
M. Frank, P. Wolfe, et al., An algorithm for quadratic programming, Naval research logistics quarterly 3 (1-2) (1956) 95–110
1956
Earlier work this paper cites.
K. Arrow, L. Hurwicz, H. Uzawa, Studies in linear and non-linear programming., in: H. Chenery, S. Johnson, S. Karlin, T. Marschak, R. Solow (Eds.), Stanford Mathematical Studies in the Social Sciences, vol. II., Stanford University Press, Stanford, 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 4 (5) (1964) 1–17
1964
Earlier work this paper cites.
J.-J. Moreau, Proximité et dualité dans un espace Hilbertien, Bulletin de la Société mathématique de France 93 (1965) 273–299
1965
Earlier work this paper cites.
E. S. Levitin, B. T. Polyak, Constrained minimization methods, USSR Computational mathematics and mathematical physics 6 (5) (1966) 1–50
1966
Earlier work this paper cites.
Z. Opial, Weak convergence of the sequence of successive approximations for nonexpansive mappings, Bulletin of the American Mathematical Society 73 (4) (1967) 591–597
1967
Earlier work this paper cites.
M. D. Canon, C. D. Cullum, A tight upper bound on the rate of convergence of Frank-Wolfe algorithm, SIAM Journal on Control 6 (4) (1968) 509–516
1968
Earlier work this paper cites.
R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, 1970
1970
Earlier work this paper cites.
P. Wolfe, Convergence theory in nonlinear programming, in: J. Abadie (Ed.), Integer and nonlinear programming, North-Holland, Amsterdam, 1970
1970
Earlier work this paper cites.
C. A. Holloway, An extension of the Frank and Wolfe method of feasible directions, Mathematical Programming 6 (1) (1974) 14–27
1974
Earlier work this paper cites.
R. T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM journal on control and optimization 14 (5) (1976) 877–898
1976
Earlier work this paper cites.
R. T. Rockafellar, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Mathematics of operations research 1 (2) (1976) 97–116
1976
Earlier work this paper cites.
B. Von Hohenbalken, Simplicial decomposition in nonlinear programming algorithms, Mathematical Programming 13 (1) (1977) 49–68
1977
Earlier work this paper cites.
J. C. Dunn, Rates of convergence for conditional gradient algorithms near singular and nonsingular extremals, SIAM Journal on Control and Optimization 17 (2) (1979) 187–211
1979
Earlier work this paper cites.
S. M. Robinson, Generalized equations and their solutions, part ii: applications to nonlinear programming, in: Optimality and Stability in Mathematical Programming, Springer, 1982, pp. 200–221
1982
Earlier work this paper cites.
A. Nemirovski, Orth-method for smooth convex optimization, Izvestia AN SSSR, Transl.: Eng. Cybern. Soviet J. Comput. Syst. Sci 2 (1982) 937–947
1982
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 (2) (1983) 372–376
1983
Earlier work this paper cites.
R. M. Gower, M. Schmidt, F. Bach, P. Richtárik, Variance-reduced methods for machine learning, Proceedings of the IEEE 108 (11) (2020) 1968–1983
1983
Earlier work this paper cites.
A. S. Nemirovski, D. B. Yudin, Problem Complexity and Method Efficiency in Optimization, Wiley, New York, NY, 1983
1983
Earlier work this paper cites.
D. Gabay, Applications of the method of multipliers to variational inequalities, Vol. 15, Elsevier, 1983, Ch. ix, pp. 299–331
1983
Earlier work this paper cites.
H. J. Kushner, Approximation and Weak Convergence Methods for Random Processes, The MIT Press, 1984
1984
Earlier work this paper cites.
A. Nemirovskii, Y. Nesterov, Optimal methods of smooth convex minimization, USSR Computational Mathematics and Mathematical Physics 25 (2) (1985) 21 – 30
1985
Earlier work this paper cites.
J. Guélat, P. Marcotte, Some comments on Wolfe’s ‘away step’, Mathematical Programming 35 (1) (1986) 110–119
1986
Earlier work this paper cites.
B. T. Polyak, Introduction to Optimization, Optimization Software, 1987
1987
Earlier work this paper cites.
A. Benveniste, M. Métivier, P. Priouret, Adaptive Algorithms and Stochastic Approximations, Springer, Berlin, 1990
1990
Earlier work this paper cites.
P. Tseng, Applications of a splitting algorithm to decomposition in convex programming and variational inequalities, SIAM Journal on Control and Optimization 29 (1) (1991) 119–138
1991
Earlier work this paper cites.
M. Teboulle, Entropic proximal mappings with applications to nonlinear programming, Mathematics of Operations Research 17 (1992) 670–690
1992
Earlier work this paper cites.
J. Eckstein, D. P. Bertsekas, On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators, Mathematical Programming 55 (1-3) (1992) 293–318
1992
Earlier work this paper cites.
J. Kuczyński, H. Woźniakowski, Estimating the largest eigenvalue by the power and lanczos algorithms with a random start, SIAM Journal on Matrix Analysis and Applications 13 (4) (1992) 1094–1122
1992
Earlier work this paper cites.
G. Chen, M. Teboulle, Convergence analysis of a proximal-like minimization algorithm using Bregman functions, SIAM Journal on Optimization 3 (3) (1993) 538–543
1993
Earlier work this paper cites.
Y. Nesterov, A. Nemirovski, Interior Point Polynomial methods in Convex programming, SIAM Publications, 1994
1994
Earlier work this paper cites.
U. Helmke, J. B. Moore, Optimization and Dynamical Systems, Communications & Control Engineering, Springer Berlin Heidelberg, 1996
1996
Earlier work this paper cites.
M. Benaïm, Recursive algorithms, urn processes, and the chaining number of chain recurrent sets, Ergodic Theory and Dynamical Systems 18 (1998) 53–87
1998
Earlier work this paper cites.
R. T. Rockafellar, R. J. B. Wets, Variational Analysis, Vol. 317 of A Series of Comprehensive Studies in Mathematics, Springer-Verlag, Berlin, 1998
1998
Earlier work this paper cites.
M. Doljansky, M. Teboulle, An interior proximal algorithm and the exponential multiplier method for semidefinite programming, SIAM Journal on Optimization 9 (1) (1998) 1–13
1998
Earlier work this paper cites.
J. F. Sturm, Using sedumi 1.02, a Matlab toolbox for optimization over symmetric cones, Optimization methods and software 11 (1-4) (1999) 625–653
1999
Earlier work this paper cites.
D. Bertsekas, Nonlinear Programming, Athena Scientific, 1999
1999
Earlier work this paper cites.
E. D. Andersen, K. D. Andersen, The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm, Springer US, Boston, MA, 2000, pp. 197–232
2000
Earlier work this paper cites.
S. Sorin, A First-Course on Zero-Sum Repeated Games, Springer, 2000
2000
Earlier work this paper cites.
M. Epelman, R. M. Freund, Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system, Mathematical Programming 88 (3) (2000) 451–485
2000
Earlier work this paper cites.
J.-B. Hiriart-Urrut, C. Lemaréchal, Fundamentals of Convex Analysis, Springer, 2001
2001
Earlier work this paper cites.
2001
Earlier work this paper cites.
2002
Earlier work this paper cites.
2002
Earlier work this paper cites.
A. Beck, M. Teboulle, Mirror descent and nonlinear projected subgradient methods for convex optimization, Operations Research Letters 31 (3) (2003) 167–175
2003
Earlier work this paper cites.
J. Bolte, M. Teboulle, Barrier operators and associated gradient-like dynamical systems for constrained minimization problems, SIAM Journal on Control and Optimization 42 (4) (2003) 1266–1292
2003
Earlier work this paper cites.
F. Facchinei, J.-s. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems - Volume I and Volume II, Springer Series in Operations Research, 2003
2003
Earlier work this paper cites.
I. Daubechies, M. Defrise, C. De Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Communications on pure and applied mathematics 57 (11) (2004) 1413–1457
2004
Earlier work this paper cites.
S. Boyd, L. Vandenberghe, Convex optimization, Cambridge university press, 2004
2004
Earlier work this paper cites.
F. Alvarez, J. Bolte, O. Brahic, Hessian Riemannian gradient flows in convex programming, SIAM Journal on Control and Optimization 43 (2) (2004) 477–501
2004
Earlier work this paper cites.
H. Attouch, J. Bolte, P. Redont, M. Teboulle, Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization, Optimization 53 (5-6) (2004) 435–454
2004
Earlier work this paper cites.
H. Attouch, M. Teboulle, Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization, Journal of Optimization Theory and Applications 121 (3) (2004) 541–570
2004
Earlier work this paper cites.
A. Beck, M. Teboulle, A conditional gradient method with linear rate of convergence for solving convex linear systems, Mathematical Methods of Operations Research 59 (2) (2004) 235–247
2004
Earlier work this paper cites.
A. Nemirovski, 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, SIAM Journal on Optimization 15 (1) (2004) 229–251
2004
Earlier work this paper cites.
2004
Earlier work this paper cites.
P. L. Combettes, V. R. Wajs, Signal recovery by proximal forward-backward splitting, Multiscale Modeling & Simulation 4 (4) (2005) 1168–1200
2005
Earlier work this paper cites.
A. Juditsky, A. V. Nazin, A. B. Tsybakov, N. Vayatis, Recursive aggregation of estimators by the mirror descent algorithm with averaging, Problems of Information Transmission 41 (4) (2005) 368–384
2005
Earlier work this paper cites.
Y. Nesterov, Smooth minimization of non-smooth functions, Mathematical Programming 103 (1) (2005) 127–152
2005
Earlier work this paper cites.
Y. Nesterov, Excessive gap technique in nonsmooth convex minimization, SIAM Journal on Optimization 16 (1) (2005) 235–249
2005
Earlier work this paper cites.
A. Auslender, M. Teboulle, Interior gradient and proximal methods for convex and conic optimization, SIAM Journal on Optimization 16 (3) (2006) 697–725
2006
Earlier work this paper cites.
A. Auslender, M. Teboulle, Asymptotic cones and functions in optimization and variational inequalities, Springer Science & Business Media, 2006
2006
Earlier work this paper cites.
E. J. Candes, J. Romberg, T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, IEEE Transactions on Information Theory 52 (2) (2006) 489–509
2006
Earlier work this paper cites.
D. L. Donoho, Compressed sensing, IEEE Transactions on Information Theory 52 (4) (2006) 1289–1306
2006
Cited alongside, same era.
H. Attouch, P. Redont, A. Soubeyran, A new class of alternating proximal minimization algorithms with costs-to-move, SIAM Journal on Optimization 18 (3) (2007) 1061–1081
2007
Cited alongside, same era.
Y. Nesterov, Dual extrapolation and its applications to solving variational inequalities and related problems, Mathematical Programming 109 (2) (2007) 319–344
2007
Cited alongside, same era.
E. Candes, T. Tao, The Dantzig selector: Statistical estimation when p p is much larger than n n , The Annals of Statistics 35 (6) (2007) 2313–2351
2007
Cited alongside, same era.
S. Damla Ahipasaoglu, P. Sun, M. J. Todd, Linear convergence of a modified frank–wolfe algorithm for computing minimum-volume enclosing ellipsoids, Optimisation Methods and Software 23 (1) (2008) 5–19
R. M. Freund, P. Grigas, New analysis and results for the Frank–Wolfe method, Mathematical Programming 155 (1-2) (2016) 199–230
2016
Later among the works it cites.
G. Odor, Y.-H. Li, A. Yurtsever, Y.-P. Hsieh, Q. Tran-Dinh, M. El Halabi, V. Cevher, Frank-Wolfe works for non-Lipschitz continuous gradient objectives: scalable poisson phase retrieval, in: 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Ieee, 2016, pp. 6230–6234
2016
Later among the works it cites.
D. Garber, E. Hazan, A linearly convergent variant of the conditional gradient algorithm under strong convexity, with applications to online and stochastic optimization, SIAM Journal on Optimization 26 (3) (2016) 1493–1528
2016
Later among the works it cites.
G. Lan, Y. Zhou, Conditional gradient sliding for convex optimization, SIAM Journal on Optimization 26 (2) (2016) 1379–1409
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
A. d’Aspremont, Smooth optimization with approximate gradient, SIAM J. on Optimization 19 (3) (2008) 1171–1183
2008
Cited alongside, same era.
Y. Nesterov, Accelerating the cubic regularization of newton’s method on convex problems, Mathematical Programming 112 (1) (2008) 159–181
2008
Cited alongside, same era.
P. Tseng, On accelerated proximal gradient methods for convex-concave optimization, Tech. rep., MIT (2008). URL http://www.mit.edu/˜dimitrib/PTseng/papers/apgm.pdf
2008
Cited alongside, same era.
A. Shapiro, D. Dentcheva, A. Ruszczyński, Lectures on Stochastic Programming, Society for Industrial and Applied Mathematics, 2009
2009
Cited alongside, same era.
A. Bruckstein, D. Donoho, M. Elad, From sparse solutions of systems of equations to sparse modeling of signals and images, SIAM Review 51 (1) (2009) 34–81
2009
Cited alongside, same era.
A. Auslender, M. Teboulle, Projected subgradient methods with non-euclidean distances for non-differentiable convex minimization and variational inequalities, Mathematical Programming 120 (1) (2009) 27–48
2009
Cited alongside, same era.
A. Beck, M. Teboulle, Gradient-based algorithms with applications to signal recovery, in: D. P. Palomar, Y. C. Eldar (Eds.), Convex optimization in signal processing and communications, Cambridge University Press, 2009, pp. 42–88
2009
Cited alongside, same era.
P. Dvurechensky, A. Gasnikov, Stochastic intermediate gradient method for convex problems with stochastic inexact oracle, Journal of Optimization Theory and Applications 171 (1) (2016) 121–145
2016
Later among the works it cites.
A. V. Gasnikov, P. E. Dvurechensky, Stochastic intermediate gradient method for convex optimization problems, Doklady Mathematics 93 (2) (2016) 148–151
2016
Later among the works it cites.
2016
Later among the works it cites.
Z. Allen-Zhu, Z. Qu, P. Richtarik, Y. Yuan, Even faster accelerated coordinate descent using non-uniform sampling, in: M. F. Balcan, K. Q. Weinberger (Eds.), Proceedings of The 33rd International Conference on Machine Learning, Vol. 48 of Proceedings of Machine Learning Research, PMLR, New York, New York, USA, 2016, pp. 1110–1119
2016
Later among the works it cites.
Z. Allen-Zhu, E. Hazan, Optimal black-box reductions between optimization objectives, in: D. Lee, M. Sugiyama, U. Luxburg, I. Guyon, R. Garnett (Eds.), Advances in Neural Information Processing Systems, Vol. 29, Curran Associates, Inc., 2016, pp. 1614–1622
2016
Later among the works it cites.
A. Chernov, P. Dvurechensky, A. Gasnikov, Fast primal-dual gradient method for strongly convex minimization problems with linear constraints, in: Y. Kochetov, M. Khachay, V. Beresnev, E. Nurminski, P. Pardalos (Eds.), Discrete Optimization and Operations Research: 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings, Springer International Publishing, 2016, pp. 391–403
2016
Later among the works it cites.
2016
Later among the works it cites.
P. Jain, P. Kar, Non-convex optimization for machine learning, Found. Trends Mach. Learn. 10 (3–4) (2017) 142–336
2017
Later among the works it cites.
A. Beck, First-Order Methods in Optimization, Society for Industrial and Applied Mathematics, 2017
2017
Later among the works it cites.
M. J. Feizollahi, S. Ahmed, A. Sun, Exact augmented Lagrangian duality for mixed integer linear programming, Mathematical Programming 161 (1) (2017) 365–387
2017
Later among the works it cites.
A. Beck, S. Shtern, Linearly convergent away-step conditional gradient for non-strongly convex functions, Mathematical Programming 164 (1-2) (2017) 1–27
2017
Later among the works it cites.
2017
Later among the works it cites.
Y. Nesterov, V. Spokoiny, Random gradient-free minimization of convex functions, Found. Comput. Math. 17 (2) (2017) 527–566,
2017
Later among the works it cites.
J. Bolte, T. P. Nguyen, J. Peypouquet, B. W. Suter, From error bounds to the complexity of first-order descent methods for convex functions, Mathematical Programming 165 (2) (2017) 471–507
2017
Later among the works it cites.
V. Roulet, A. d’Aspremont, Sharpness, restart and acceleration, in: I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, R. Garnett (Eds.), Advances in Neural Information Processing Systems 30, Curran Associates, Inc., 2017, pp. 1119–1129
2017
Later among the works it cites.
Y. Chen, G. Lan, Y. Ouyang, Accelerated schemes for a class of variational inequalities, Mathematical Programming 165 (2017), 113–149
2017
Later among the works it cites.
A. Alacaoglu, Q. Tran Dinh, O. Fercoq, V. Cevher, Smooth primal-dual coordinate descent algorithms for nonsmooth convex optimization, in: I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, R. Garnett (Eds.), Advances in Neural Information Processing Systems 30, Curran Associates, Inc., 2017, pp. 5852–5861
2017
Later among the works it cites.
A. S. Anikin, A. V. Gasnikov, P. E. Dvurechensky, A. I. Tyurin, A. V. Chernov, Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints, Computational Mathematics and Mathematical Physics 57 (8) (2017) 1262–1276
2017
Later among the works it cites.
S. J. Wright, Optimization algorithms for data analysis, The Mathematics of Data 25 (2018) 49
2018
Later among the works it cites.
P. Mertikopoulos, M. Staudigl , SIAM Journal on Optimization 28 (1) (2018) 163–197
2018
Later among the works it cites.
P. Mertikopoulos, M. Staudigl, Stochastic mirror descent dynamics and their convergence in monotone variational inequalities, Journal of Optimization Theory and Applications 179 (3) (2018) 838–867
2018
Later among the works it cites.
J. C. Duchi, F. Ruan, Stochastic methods for composite and weakly convex optimization problems, SIAM Journal on Optimization 28 (4) (2018) 3229–3259
2018
Later among the works it cites.
Y. Nesterov, Lectures on Convex Optimization, Vol. 137 of Springer Optimization and Its Applications, Springer International Publishing, 2018
2018
Later among the works it cites.
M. Teboulle, A simplified view of first order methods for optimization, Mathematical Programming 170 (1) (2018) 67–96
2018
Later among the works it cites.
H. Lu, R. Freund, Y. Nesterov, Relatively smooth convex optimization by first-order methods, and applications, SIAM Journal on Optimization 28 (1) (2018) 333–354
2018
Later among the works it cites.
H. Attouch, Z. Chbani, J. Peypouquet, P. Redont, Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity, Mathematical Programming 168 (1-2) (2018) 123–175
2018
Later among the works it cites.
Y. Nesterov, Complexity bounds for primal-dual methods minimizing the model of objective function, Mathematical Programming 171 (1-2) (2018) 311–330
2018
Later among the works it cites.
P. Dvurechensky, D. Dvinskikh, A. Gasnikov, C. A. Uribe, A. Nedić, Decentralize and randomize: Faster algorithm for Wasserstein barycenters, in: S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, R. Garnett (Eds.), Advances in Neural Information Processing Systems 31, NeurIPS 2018, Curran Associates, Inc., 2018, pp. 10783–10793
2018
Later among the works it cites.
2018
Later among the works it cites.
G. Lan, Y. Zhou, An optimal randomized incremental gradient method, Mathematical Programming 171 (2018), 167-215
2018
Later among the works it cites.
J. Diakonikolas, L. Orecchia, Alternating randomized block coordinate descent, in: J. Dy, A. Krause (Eds.), Proceedings of the 35th International Conference on Machine Learning, Vol. 80 of Proceedings of Machine Learning Research, PMLR, Stockholmsmässan, Stockholm Sweden, 2018, pp. 1224–1232
2018
Later among the works it cites.
A. Gasnikov, Yu. Nesterov, Universal method for stochastic composite optimization problems, Computational Mathematics and Mathematical Physics 58 (1) (2018) 48–64
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
Y. Malitsky, T. Pock, A first-order primal-dual algorithm with linesearch, SIAM Journal on Optimization 28 (1) (2018) 411–432
2018
Later among the works it cites.
2018
Later among the works it cites.
A. Beck, N. Guttmann-Beck, FOM –a Matlab toolbox of first-order methods for solving convex optimization problems, Optimization Methods and Software 34 (1) (2019) 172–193
2019
Later among the works it cites.
I. M. Bomze, P. Mertikopoulos, W. Schachinger, M. Staudigl, Hessian barrier algorithms for linearly constrained optimization problems, SIAM Journal on Optimization 29 (3) (2019) 2100–2127
2019
Later among the works it cites.
B. Shi, S. S. Du, W. Su, M. I. Jordan, Acceleration via symplectic discretization of high-resolution differential equations, Advances in Neural Information Processing Systems (2019) 5744–5752
2019
Later among the works it cites.
G. Haeser, H. Liu, Y. Ye, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary , Mathematical Programming 178 (2019), 263–299
2019
Later among the works it cites.
A. V. Gasnikov, A. I. Tyurin, Fast gradient descent for convex minimization problems with an oracle producing a ( δ \delta , L)-model of function at the requested point, Computational Mathematics and Mathematical Physics 59 (7) (2019) 1085–1097
2019
Later among the works it cites.
2019
Later among the works it cites.
E. A. Vorontsova, A. V. Gasnikov, E. A. Gorbunov, P. E. Dvurechenskii, Accelerated gradient-free optimization methods with a non-euclidean proximal operator, Automation and Remote Control 80 (8) (2019) 1487–1501
2019
Later among the works it cites.
E. A. Vorontsova, A. V. Gasnikov, E. A. Gorbunov, Accelerated directional search with non-euclidean prox-structure, Automation and Remote Control 80 (4) (2019) 693–707
2019
Later among the works it cites.
Y. Nesterov, Implementable tensor methods in unconstrained convex optimization, Mathematical Programming (2019)
2019
Later among the works it cites.
2019
Later among the works it cites.
I. Necoara, Y. Nesterov, F. Glineur, Linear convergence of first order methods for non-strongly convex optimization, Mathematical Programming 175 (1) (2019) 69–107
2019
Later among the works it cites.
T. Kerdreux, A. d’Aspremont, S. Pokutta, Restarting Frank-Wolfe, in: K. Chaudhuri, M. Sugiyama (Eds.), Proceedings of Machine Learning Research, Vol. 89 of Proceedings of Machine Learning Research, PMLR, 2019, pp. 1275–1283
2019
Later among the works it cites.
S. V. Guminov, Y. E. Nesterov, P. E. Dvurechensky, A. V. Gasnikov, Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems, Doklady Mathematics 99 (2) (2019) 125–128
2019
Later among the works it cites.
T. Lin, N. Ho, M. Jordan, On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms, in: K. Chaudhuri, R. Salakhutdinov (Eds.), Proceedings of the 36th International Conference on Machine Learning, Vol. 97 of Proceedings of Machine Learning Research, PMLR, Long Beach, California, USA, 2019, pp. 3982–3991
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
D. Davis, D. Drusvyatskiy, S. Kakade, J. D. Lee, Stochastic subgradient method converges on tame functions, Foundations of Computational Mathematics 20 (1) (2020) 119–154
2020
Later among the works it cites.
G. Lan, First-order and Stochastic Optimization Methods for Machine Learning, Springer, 2020.
2020
Later among the works it cites.
A. Ben-Tal, A. Nemirovski, Lectures on Modern Convex Optimization (Lecture Notes) , Personal web-page of A. Nemirovski, 2020. URL https://www2.isye.gatech.edu/˜nemirovs/LMCOLN2020WithSol.pdf
2020
Later among the works it cites.
H. Attouch, Z. Chbani, J. Fadili, H. Riahi, First-order optimization algorithms via inertial systems with Hessian driven damping, Mathematical Programming (2020)
2020
Later among the works it cites.
F. Pedregosa, G. Negiar, A. Askari, M. Jaggi, Linearly convergent Frank-Wolfe with backtracking line-search, in: International Conference on Artificial Intelligence and Statistics, PMLR, 2020, pp. 1–10
2020
Later among the works it cites.
P. Dvurechensky, P. Ostroukhov, K. Safin, S. Shtern, M. Staudigl, Self-concordant analysis of frank-Wolfe algorithms, in: H. D. III, A. Singh (Eds.), Proceedings of the 37th International Conference on Machine Learning, Vol. 119 of Proceedings of Machine Learning Research, PMLR, Virtual, 2020, pp. 2814–2824
2020
Later among the works it cites.
Y. Nesterov, A. Gasnikov, S. Guminov, P. Dvurechensky, Primal-dual accelerated gradient methods with small-dimensional relaxation oracle, Optimization Methods and Software (2020) 1–28
2020
Later among the works it cites.
E. Gorbunov, M. Danilova, A. Gasnikov, Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping, in: Proceedings of the 33rd International Conference on Neural Information Processing Systems, NeurIPS 2020, 2020
2020
Later among the works it cites.
O. Fercoq, Z. Qu, Restarting the accelerated coordinate descent method with a rough strong convexity estimate, Computational Optimization and Applications 75 (1) (2020) 63–91
2020
Later among the works it cites.
Q. Tran-Dinh, A. Alacaoglu, O. Fercoq, V. Cevher, An adaptive primal-dual framework for nonsmooth convex minimization, Mathematical Programming Computation 12 (3) (2020) 451–491
2020
Later among the works it cites.
P. Dvurechensky, A. Gasnikov, S. Omelchenko, A. Tiurin, A stable alternative to Sinkhorn’s algorithm for regularized optimal transport, in: A. Kononov, M. Khachay, V. A. Kalyagin, P. Pardalos (Eds.), Mathematical Optimization Theory and Operations Research, Springer International Publishing, Cham, 2020, pp. 406–423
2020
Later among the works it cites.
2020
Later among the works it cites.
P. Dvurechensky, E. Gorbunov, A. Gasnikov, An accelerated directional derivative method for smooth stochastic convex optimization, European Journal of Operational Research 290 (2) (2021) 601–621
2021
Closest in time.
O. Fercoq, P. Richtárik, Accelerated, parallel, and proximal coordinate descent, SIAM Journal on Optimization 25 (4) (2015) 1997–2023
2023
Closest in time.
S. Ghadimi, G. Lan, Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, ii: Shrinking procedures and optimal algorithms, SIAM Journal on Optimization 23 (4) (2013) 2061–2089
2089
Closest in time.