Fetching the paper…
Reading the bibliography…
PEPit is a Python package aiming at simplifying the access to worst-case analyses of a large family of first-order optimization methods possibly involving gradient, projection, proximal, or linear optimization oracles, along with their approximate, or Bregman variants.
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.
Journal of Complexity 8
Nemirovsky, A.S.: Information-based complexity of linear operator equations · 1992
Earlier work this paper cites.
Lecture notes, http://www2.isye.gatech.edu/~nemirovs/Lec_EMCO.pdf (1994)
Nemirovski, A.: Information-based complexity of convex programming · 1994
Earlier work this paper cites.
In: American Control Conference (ACC)., vol. 3, pp. 2156–2162. IEEE (2003)
Fazel, M., Hindi, H., Boyd, S.P.: Log-det heuristic for matrix rank minimization with applications to hankel and euclidean distance matrices · 2003
Earlier work this paper cites.
Springer (2003)
Nesterov, Y.: Introductory Lectures on Convex Optimization · 2003
Earlier work this paper cites.
Online at http://www.mosek.com 54
Mosek, A.: The MOSEK optimization software · 2010
Earlier work this paper cites.
SIAM review 52
Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization · 2010
Earlier work this paper cites.
Ph.D. thesis, Tel-Aviv University (2014)
Drori, Y.: Contributions to the complexity analysis of optimization algorithms · 2014
Earlier work this paper cites.
Mathematical Programming 145
Drori, Y., Teboulle, M.: Performance of first-order methods for smooth convex minimization: a novel approach · 2014
Earlier work this paper cites.
In: Proceedings of the 53rd Conference on Decision and Control (CDC) (2014)
Patrinos, P., Stella, L., Bemporad, A.: Douglas-Rachford splitting: Complexity estimates and accelerated variants · 2014
Earlier work this paper cites.
In: Advances in Neural Information Processing Systems (NIPS) (2016)
Defazio, A.: A simple practical accelerated method for finite sums · 2016
Earlier work this paper cites.
The Journal of Machine Learning Research (JMLR) 17
Diamond, S., Boyd, S.: CVXPY: A Python-embedded modeling language for convex optimization · 2016
Earlier work this paper cites.
Mathematical Programming 159
Kim, D., Fessler, J.A.: Optimized first-order methods for smooth convex minimization · 2016
Earlier work this paper cites.
SIAM Journal on Optimization 26
Lessard, L., Recht, B., Packard, A.: Analysis and design of optimization algorithms via integral quadratic constraints · 2016
Cited alongside, same era.
Journal of Optimization Theory and Applications 169
O’Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding · 2016
Cited alongside, same era.
SIAM Journal on Optimization 27
Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case performance of first-order methods for composite convex optimization · 2017
Cited alongside, same era.
In: Proceedings of the 56th Conference on Decision and Control (CDC) (2017)
Taylor, A.B., Hendrickx, J.M., Glineur, F.: Performance estimation toolbox (PESTO): automated worst-case analysis of first-order optimization methods · 2017
Cited alongside, same era.
Mathematical Programming 161
Taylor, A.B., Hendrickx, J.M., Glineur, F.: Smooth strongly convex interpolation and exact worst-case performance of first-order methods · 2017
Cited alongside, same era.
IEEE Control Systems Letters 2
IEEE Transactions on Control of Network Systems 7
Sundararajan, A., Van Scoy, B., Lessard, L.: Analysis and design of first-order distributed optimization algorithms over time-varying graphs · 2020
Later among the works it cites.
Optimization Letters (2021)
Abbaszadehpeivasti, H., de Klerk, E., Zamani, M.: The exact worst-case convergence rate of the gradient method with fixed step lengths for L L -smooth functions · 2021
Later among the works it cites.
In: Proceedings of the 60th Conference on Decision and Control (CDC) (2021)
Colla, S., Hendrickx, J.M.: Automated worst-case performance analysis of decentralized gradient descent · 2021
Later among the works it cites.
Foundations and Trends® in Optimization 5
d’Aspremont, A., Scieur, D., Taylor, A.: Acceleration methods · 2021
Later among the works it cites.
Mathematical Programming pp. 1–42 (2021)
Gannot, O.: A frequency-domain analysis of inexact gradient methods · 2021
Later among the works it cites.
Mathematical Programming pp. 1–31 (2021)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Van Scoy, B., Freeman, R.A., Lynch, K.M.: The fastest known globally convergent first-order method for minimizing strongly convex functions · 2017
Cited alongside, same era.
SIAM Journal on Optimization 28
Fazlyab, M., Ribeiro, A., Morari, M., Preciado, V.M.: Analysis of optimization algorithms via integral quadratic constraints: Nonstrongly convex problems · 2018
Cited alongside, same era.
In: International Conference on Machine Learning (ICML) (2018)
Hu, B., Wright, S., Lessard, L.: Dissipativity theory for accelerating stochastic variance reduction: A unified analysis of svrg and katyusha using semidefinite programs · 2018
Cited alongside, same era.
In: International Conference on Machine Learning (ICML) (2018)
Taylor, A., Van Scoy, B., Lessard, L.: Lyapunov functions for first-order methods: Tight automated convergence guarantees · 2018
Cited alongside, same era.
Journal of Optimization Theory and Applications 178
Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case convergence rates of the proximal gradient method for composite convex minimization · 2018
Cited alongside, same era.
In: Proceedings of the 32nd Conference on Learning Theory (COLT) (2019)
Taylor, A., Bach, F.: Stochastic first-order methods: non-asymptotic and computer-aided analyses via potential functions · 2019
Cited alongside, same era.
SIAM Journal on Optimization 30
Gu, G., Yang, J.: Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems · 2020
Cited alongside, same era.
Kim, D.: Accelerated proximal point method for maximally monotone operators · 2021
Later among the works it cites.
Journal of Optimization Theory and Applications 188
Kim, D., Fessler, J.A.: Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions · 2021
Later among the works it cites.
Optimization Letters 15
Lieder, F.: On the convergence rate of the Halpern-iteration · 2021
Later among the works it cites.
In: International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 366–402 (2022)
Gorbunov, E., Loizou, N., Gidel, G.: Extragradient method: o ( 1 / k ) o(1/k) last-iterate convergence for monotone variational inequalities and connections with cocoercivity · 2022
Closest in time.
Bousselmi, N., Hendrickx, J.M., Glineur, F.: Interpolation conditions for linear operators and applications to performance estimation problems · 2023
Closest in time.
IEEE Control Systems Letters (2023)
Goujaud, B., Dieuleveut, A., Taylor, A.: Counter-examples in first-order optimization: a constructive approach · 2023
Closest in time.
Mathematical Programming 199
Taylor, A., Drori, Y.: An optimal gradient method for smooth strongly convex minimization · 2023
Closest in time.
Upadhyaya, M., Banert, S., Taylor, A.B., Giselsson, P.: Automated tight lyapunov analysis for first-order methods · 2023
Closest in time.