Fetching the paper…
Reading the bibliography…
The Performance Estimation Problem methodology makes it possible to determine the exact worst-case performance of an optimization method.
Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems
Gu, G. and Yang, J. (2020) · 1921
Earlier work this paper cites.
Generalizing the optimized gradient method for smooth convex minimization
Kim, D. and Fessler, J. A. (2018b) · 1950
Earlier work this paper cites.
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D. and Mercier, B. (1976) · 1976
Earlier work this paper cites.
Perturbation theory for the least squares problem with linear equality constraints
Eldén, L. (1980) · 1980
Earlier work this paper cites.
Norm-preserving dilations and their applications to optimal error bounds
Davis, C., Kahan, W., and Weinberger, H. (1982) · 1982
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate 𝒪 ( 1 k 2 ) \mathcal{O}(\frac{1}{k^{2}})
Nesterov, Y. E. (1983) · 1983
Earlier work this paper cites.
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., and Fatemi, E. (1992) · 1992
Earlier work this paper cites.
Basis pursuit
Chen, S. and Donoho, D. (1994) · 1994
Earlier work this paper cites.
Convex optimization
Boyd, S. P. and Vandenberghe, L. (2004) · 2004
Earlier work this paper cites.
Robust regression and outlier detection
Rousseeuw, P. J. and Leroy, A. M. (2005) · 2005
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Beck, A. and Teboulle, M. (2009) · 2009
Earlier work this paper cites.
Notes on the Schur complement
Gallier, J. H. (2010) · 2010
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
Chambolle, A. and Pock, T. (2011) · 2011
Earlier work this paper cites.
Matrix analysis
Horn, R. A. and Johnson, C. R. (2012) · 2012
Earlier work this paper cites.
A primal–dual splitting method for convex optimization involving lipschitzian, proximable and linear composite terms
Condat, L. (2013) · 2013
Earlier work this paper cites.
A splitting algorithm for dual monotone inclusions involving cocoercive operators
Vũ, B. C. (2013) · 2013
Earlier work this paper cites.
Performance of first-order methods for smooth convex minimization: a novel approach
Drori, Y. and Teboulle, M. (2014) · 2014
Earlier work this paper cites.
A simple algorithm for a class of nonsmooth convex–concave saddle-point problems
Drori, Y., Sabach, S., and Teboulle, M. (2015) · 2015
Earlier work this paper cites.
On the ergodic convergence rates of a first-order primal–dual algorithm
Chambolle, A. and Pock, T. (2016) · 2016
Earlier work this paper cites.
A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
Chen, P., Huang, J., and Zhang, X. (2016) · 2016
Earlier work this paper cites.
An optimal variant of Kelley’s cutting-plane method
Drori, Y. and Teboulle, M. (2016) · 2016
Cited alongside, same era.
Optimized first-order methods for smooth convex minimization
Kim, D. and Fessler, J. A. (2016) · 2016
Cited alongside, same era.
Shi, Z. and Liu, R. (2016) · 2016
Cited alongside, same era.
Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
Yi, P., Hong, Y., and Liu, F. (2016) · 2016
Cited alongside, same era.
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
De Klerk, E., Glineur, F., and Taylor, A. B. (2017) · 2017
Cited alongside, same era.
On the convergence rate of the halpern-iteration
Lieder, F. (2021) · 2021
Later among the works it cites.
Abbaszadehpeivasti, H., de Klerk, E., and Zamani, M. (2022) · 2022
Later among the works it cites.
An accelerated coordinate gradient descent algorithm for non-separable composite optimization
Aberdam, A. and Beck, A. (2022) · 2022
Later among the works it cites.
The MOSEK optimization toolbox for MATLAB manual. Version 10.0
ApS, M. (2022) · 2022
Later among the works it cites.
Proximal methods materials
Beck, A. (2022) · 2022
Later among the works it cites.
Performance estimation of first-order methods on quadratic functions
Bousselmi, N., Hendrickx, J., and Glineur, F. (2022) · 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the convergence analysis of the optimized gradient method
Kim, D. and Fessler, J. A. (2017) · 2017
Cited alongside, same era.
Convex interpolation and performance estimation of first-order methods for convex optimization
Taylor, A. B. (2017) · 2017
Cited alongside, same era.
Performance estimation toolbox (pesto): Automated worst-case analysis of first-order optimization methods
Taylor, A. B., Hendrickx, J. M., and Glineur, F. (2017a) · 2017
Cited alongside, same era.
Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
Taylor, A. B., Hendrickx, J. M., and Glineur, F. (2018) · 2018
Cited alongside, same era.
A new primal–dual algorithm for minimizing the sum of three functions with a linear operator
Yan, M. (2018) · 2018
Cited alongside, same era.
Presentation on ”performance estimation of stochastic first-order methods”
Drori, Y. and Shamir, O. (2022) · 2019
Cited alongside, same era.
Linear convergence of first order methods for non-strongly convex optimization
Necoara, I., Nesterov, Y., and Glineur, F. (2019) · 2019
Cited alongside, same era.
Later among the works it cites.
Automated performance estimation for decentralized optimization via network size independent problems
Colla, S. and Hendrickx, J. M. (2022) · 2022
Later among the works it cites.
Tight ergodic sublinear convergence rate of the relaxed proximal point algorithm for monotone variational inequalities
Gu, G. and Yang, J. (2022) · 2022
Later among the works it cites.
Gradient descent is optimal under lower restricted secant inequality and upper error bound
Guille-Escuret, C., Ibrahim, A., Goujaud, B., and Mitliagkas, I. (2022) · 2022
Later among the works it cites.
Tight convergence rates of the gradient method on hypoconvex functions
Rotaru, T., Glineur, F., and Patrinos, P. (2022) · 2022
Later among the works it cites.
An optimal gradient method for smooth strongly convex minimization
Taylor, A. and Drori, Y. (2022) · 2022
Later among the works it cites.
Automatic performance estimation for decentralized optimization
Colla, S. and Hendrickx, J. M. (2023) · 2023
Closest in time.
Proximal splitting algorithms for convex optimization: A tour of recent advances, with new twists
Condat, L., Kitahara, D., Contreras, A., and Hirabayashi, A. (2023) · 2023
Closest in time.
Convergence of proximal point and extragradient-based methods beyond monotonicity: the case of negative comonotonicity
Gorbunov, E., Taylor, A., Horváth, S., and Gidel, G. (2023) · 2023
Closest in time.
On fundamental proof structures in first-order optimization
Goujaud, B., Dieuleveut, A., and Taylor, A. (2023) · 2023
Closest in time.
On the worst-case analysis of cyclic coordinate-wise algorithms on smooth convex functions
Kamri, Y., Hendrickx, J. M., and Glineur, F. (2023) · 2023
Closest in time.
A systematic approach to lyapunov analyses of continuous-time models in convex optimization
Moucer, C., Taylor, A., and Bach, F. (2023) · 2023
Closest in time.
The exact worst-case convergence rate of the alternating direction method of multipliers
Zamani, M., Abbaszadehpeivasti, H., and de Klerk, E. (2023) · 2023
Closest in time.
Automated tight lyapunov analysis for first-order methods
Upadhyaya, M., Banert, S., Taylor, A. B., and Giselsson, P. (2024) · 2024
Closest in time.
Worst-case convergence analysis of inexact gradient and newton methods through semidefinite programming performance estimation
De Klerk, E., Glineur, F., and Taylor, A. B. (2020) · 2082
Closest in time.