Cover Image

Adaptive Acceleration Without Strong Convexity Priors Or Restarts

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cavalcanti, Joao V., Lessard, Laurent, Wilson, Ashia C.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptive Backtracking Line Search
by: Cavalcanti, Joao V., et al.
Published: (2024)

Restart-Free (Accelerated) Gradient Sliding Methods for Strongly Convex Composite Optimization
by: Wu, Xinming, et al.
Published: (2026)

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions
by: Van Scoy, Bryan, et al.
Published: (2025)

Anderson Acceleration Without Restart: A Novel Method with $n$-Step Super Quadratic Convergence Rate
by: Ye, Haishan, et al.
Published: (2024)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

Explicit Agent-Level Optimal Cooperative Controllers for Dynamically Decoupled Systems with Output Feedback
by: Kashyap, Mruganka, et al.
Published: (2019)

Optimal Control of Multi-Agent Systems with Processing Delays
by: Kashyap, Mruganka, et al.
Published: (2022)

Algebraic characterization of equivalence between oracle-based iterative algorithms
by: Lessard, Laurent, et al.
Published: (2025)

An Adaptive Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition
by: Lin, Qihang, et al.
Published: (2020)

Robust Accelerated Dynamics for Subnetwork Bilinear Zero-Sum Games with Distributed Restarting
by: Li, Weijian, et al.
Published: (2025)

Stochastic LQR Design With Disturbance Preview
by: Liu, Jietian, et al.
Published: (2024)

Adaptive Accelerated Gradient Method for Smooth Convex Optimization
by: Wang, Zepeng, et al.
Published: (2025)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
by: Xu, Zeyi, et al.
Published: (2026)

Mean-field underdamped Langevin dynamics and its spacetime discretization
by: Fu, Qiang, et al.
Published: (2023)

An automatic system to detect equivalence between iterative algorithms
by: Zhao, Shipu, et al.
Published: (2021)

HNAG$^{++}$: An Accelerated Gradient Method with a Refined Asymptotic Rate for Strongly Convex Optimization
by: Chen, Long, et al.
Published: (2025)

A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization
by: Condat, Laurent, et al.
Published: (2026)

An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization
by: Suh, Jaewook J., et al.
Published: (2025)

Restarted Halpern PDHG for Linear Programming
by: Lu, Haihao, et al.
Published: (2024)

Improved Analysis of Restarted Accelerated Gradient and Augmented Lagrangian Methods via Inexact Proximal Point Frameworks
by: Burns, Matthew X., et al.
Published: (2026)

Stealthy Optimal Range-Sensor Placement for Target Localization
by: Nooshabadi, Mohammad Hussein Yoosefian, et al.
Published: (2024)

The Method of Ellipcenters for Strongly Convex Functions
by: Bello-Cruz, Yunier
Published: (2026)

Strong Convexity of Sets in Riemannian Manifolds
by: Scieur, Damien, et al.
Published: (2023)

Decentralized Concurrent Learning with Coordinated Momentum and Restart
by: Ochoa, Daniel E., et al.
Published: (2024)

Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
by: Van Scoy, Bryan, et al.
Published: (2026)

Lower Bounds for Frank-Wolfe on Strongly Convex Sets
by: Halbey, Jannis, et al.
Published: (2026)

Complexity of Projected Gradient Methods for Strongly Convex Optimization with Hölder Continuous Gradient Terms
by: Chen, Xiaojun, et al.
Published: (2026)

Extremum Seeking is Stable for Scalar Maps that are Strictly but Not Strongly Convex
by: McNamee, Patrick, et al.
Published: (2024)

Continuized Nesterov Acceleration for Non-Convex Optimization
by: Hermant, Julien, et al.
Published: (2025)

Accelerated Backward Forward Method for Convex Optimization
by: Wang, Zepeng, et al.
Published: (2026)

Restarted contractive operators to learn at equilibrium
by: Davy, Leo, et al.
Published: (2025)

Random-Subspace Frank--Wolfe over Strongly Convex Sets
by: Poirion, Pierre-Louis, et al.
Published: (2026)

Optimal Leveraging of Smoothness and Strong Convexity for Peaceman--Rachford Splitting
by: Briceño-Arias, Luis, et al.
Published: (2026)

High-Probability Polynomial-Time Complexity of Restarted PDHG for Linear Programming
by: Xiong, Zikai
Published: (2025)

Exponential Stability of Primal-Dual Gradient Dynamics with Non-Strong Convexity
by: Chen, Xin, et al.
Published: (2019)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer
by: Xiong, Zikai
Published: (2024)

Adaptive Clutter Suppression via Convex Optimization
by: He, Yifan, et al.
Published: (2025)

Adaptive Stepsize Selection in Decentralized Convex Optimization
by: Kuruzov, Ilya, et al.
Published: (2025)

A New Complexity Result for Strongly Convex Optimization with Locally $α$-H{ö}lder Continuous Gradients
by: Chen, Xiaojun, et al.
Published: (2025)