Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
Fuente:
arXiv
Saved in:
| Main Authors: | Vernimmen, Pierre, Glineur, François |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions
by: Vernimmen, Pierre, et al.
Published: (2025)
by: Vernimmen, Pierre, et al.
Published: (2025)
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python
by: Goujaud, Baptiste, et al.
Published: (2022)
by: Goujaud, Baptiste, et al.
Published: (2022)
Exact Convergence rate of the subgradient method by using Polyak step size
by: Zamani, Moslem, et al.
Published: (2024)
by: Zamani, Moslem, et al.
Published: (2024)
Dual first-order methods for efficient computation of convex hull prices
by: Tanji, Sofiane, et al.
Published: (2025)
by: Tanji, Sofiane, et al.
Published: (2025)
Snacks: a fast large-scale kernel SVM solver
by: Tanji, Sofiane, et al.
Published: (2023)
by: Tanji, Sofiane, et al.
Published: (2023)
Instance-optimal stochastic convex optimization: Can we improve upon sample-average and robust stochastic approximation?
by: Jiang, Liwei, et al.
Published: (2026)
by: Jiang, Liwei, et al.
Published: (2026)
A simple uniformly optimal method without line search for convex optimization
by: Li, Tianjiao, et al.
Published: (2023)
by: Li, Tianjiao, et al.
Published: (2023)
Proximal gradient methods with inexact oracle of degree q for composite optimization
by: Nabou, Yassine, et al.
Published: (2024)
by: Nabou, Yassine, et al.
Published: (2024)
Nesterov acceleration in benignly non-convex landscapes
by: Gupta, Kanan, et al.
Published: (2024)
by: Gupta, Kanan, et al.
Published: (2024)
Unregularized limit of stochastic gradient method for Wasserstein distributionally robust optimization
by: Le, Tam
Published: (2025)
by: Le, Tam
Published: (2025)
Global and local approaches for the minimization of a sum of pointwise minima of convex functions
by: Van Dessel, Guillaume, et al.
Published: (2025)
by: Van Dessel, Guillaume, et al.
Published: (2025)
Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
by: Cutkosky, Ashok, et al.
Published: (2023)
by: Cutkosky, Ashok, et al.
Published: (2023)
A stochastic smoothing framework for nonconvex-nonconcave min-sum-max problems with applications to Wasserstein distributionally robust optimization
by: Liu, Wei, et al.
Published: (2025)
by: Liu, Wei, et al.
Published: (2025)
Presolve techniques for quasi-convex chance constraints with finite-support low-dimensional uncertainty
by: Van Dessel, Guillaume, et al.
Published: (2025)
by: Van Dessel, Guillaume, et al.
Published: (2025)
Random Scaling and Momentum for Non-smooth Non-convex Optimization
by: Zhang, Qinzi, et al.
Published: (2024)
by: Zhang, Qinzi, et al.
Published: (2024)
A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization
by: Alecsa, Cristian Daniel
Published: (2021)
by: Alecsa, Cristian Daniel
Published: (2021)
Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)
by: Rotaru, Teodor, et al.
Published: (2024)
Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
by: Wang, Ruyu, et al.
Published: (2023)
by: Wang, Ruyu, et al.
Published: (2023)
An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
by: Chen, Xiang, et al.
Published: (2024)
by: Chen, Xiang, et al.
Published: (2024)
Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
by: Lan, Guanghui, et al.
Published: (2024)
by: Lan, Guanghui, et al.
Published: (2024)
Linearly-scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reduction
by: Horenko, Illia, et al.
Published: (2023)
by: Horenko, Illia, et al.
Published: (2023)
Non-geodesically-convex optimization in the Wasserstein space
by: Luu, Hoang Phuc Hau, et al.
Published: (2024)
by: Luu, Hoang Phuc Hau, et al.
Published: (2024)
Learning based convex approximation for constrained parametric optimization
by: Liu, Kang, et al.
Published: (2025)
by: Liu, Kang, et al.
Published: (2025)
Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance
by: Zhang, Qi, et al.
Published: (2024)
by: Zhang, Qi, et al.
Published: (2024)
An accelerated proximal bundle method for convex optimization
by: Liao, Feng-Yi, et al.
Published: (2025)
by: Liao, Feng-Yi, et al.
Published: (2025)
First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
by: Lu, Zhaosong, et al.
Published: (2025)
by: Lu, Zhaosong, et al.
Published: (2025)
Stochastic set-valued optimization and its application to robust learning
by: Giovannelli, Tommaso, et al.
Published: (2026)
by: Giovannelli, Tommaso, et al.
Published: (2026)
A constrained optimization approach to improve robustness of neural networks
by: Zhao, Shudian, et al.
Published: (2024)
by: Zhao, Shudian, et al.
Published: (2024)
Extended convexity and smoothness and their applications in deep learning
by: Qi, Binchuan, et al.
Published: (2024)
by: Qi, Binchuan, et al.
Published: (2024)
A minimax optimal control approach for robust neural ODEs
by: Cipriani, Cristina, et al.
Published: (2023)
by: Cipriani, Cristina, et al.
Published: (2023)
LancBiO: dynamic Lanczos-aided bilevel optimization via Krylov subspace
by: Yang, Yan, et al.
Published: (2024)
by: Yang, Yan, et al.
Published: (2024)
Reinforcement learning for adaptive interior point methods in convex quadratic programming
by: Bertoncini, Jeremy, et al.
Published: (2025)
by: Bertoncini, Jeremy, et al.
Published: (2025)
Decision-calibrated prediction sets for robust power system operations
by: Stratigakos, Akylas, et al.
Published: (2026)
by: Stratigakos, Akylas, et al.
Published: (2026)
Local adapt-then-combine algorithms for distributed nonsmooth optimization: Achieving provable communication acceleration
by: Guo, Luyao, et al.
Published: (2026)
by: Guo, Luyao, et al.
Published: (2026)
BONSAI: Structure-exploiting robust Bayesian optimization for networked black-box systems under uncertainty
by: Kudva, Akshay, et al.
Published: (2025)
by: Kudva, Akshay, et al.
Published: (2025)
Convergence rates of stochastic gradient method with independent sequences of step-size and momentum weight
by: Hwang, Wen-Liang
Published: (2024)
by: Hwang, Wen-Liang
Published: (2024)
A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
by: Lauga, Guillaume
Published: (2026)
by: Lauga, Guillaume
Published: (2026)
A stochastic gradient method for trilevel optimization
by: Giovannelli, Tommaso, et al.
Published: (2025)
by: Giovannelli, Tommaso, et al.
Published: (2025)
Non-convex entropic mean-field optimization via Best Response flow
by: Lascu, Razvan-Andrei, et al.
Published: (2025)
by: Lascu, Razvan-Andrei, et al.
Published: (2025)
Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity
by: Li, Bowen, et al.
Published: (2023)
by: Li, Bowen, et al.
Published: (2023)
Similar Items
-
Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions
by: Vernimmen, Pierre, et al.
Published: (2025) -
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python
by: Goujaud, Baptiste, et al.
Published: (2022) -
Exact Convergence rate of the subgradient method by using Polyak step size
by: Zamani, Moslem, et al.
Published: (2024) -
Dual first-order methods for efficient computation of convex hull prices
by: Tanji, Sofiane, et al.
Published: (2025) -
Snacks: a fast large-scale kernel SVM solver
by: Tanji, Sofiane, et al.
Published: (2023)