Cover Image

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/ε)$ Overhead

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wu, Yue, Grimmer, Benjamin
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Some Unified Theory for Variance Reduced Prox-Linear Methods
by: Wu, Yue, et al.
Published: (2024)

Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory
by: Samakhoana, Thabo, et al.
Published: (2024)

A Practical Adaptive Subgame Perfect Gradient Method
by: Luner, Alan, et al.
Published: (2025)

A Universally Optimal Primal-Dual Method for Minimizing Heterogeneous Compositions
by: Zoll, Aaron, et al.
Published: (2025)

Inexactly Smooth Performance Estimation and New Optimized Gradient Methods
by: Zoll, Aaron, et al.
Published: (2026)

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
by: Grimmer, Benjamin, et al.
Published: (2026)

The Optimal Smoothings of Sublinear Functions and Convex Cones
by: Samakhoana, Thabo, et al.
Published: (2025)

First-Order Methods for Nonsmooth Nonconvex Functional Constrained Optimization with or without Slater Points
by: Jia, Zhichao, et al.
Published: (2022)

Goldstein Stationarity in Lipschitz Constrained Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

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

Subgame Perfect Methods in Nonsmooth Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2025)

Provably Faster Gradient Descent via Long Steps
by: Grimmer, Benjamin
Published: (2023)

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

Beyond Minimax Optimality: A Subgame Perfect Gradient Method
by: Grimmer, Benjamin, et al.
Published: (2024)

A Strengthened Conjecture on the Minimax Optimal Constant Stepsize for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

Optimal Restart Strategies for Parameter-dependent Optimization Algorithms
by: Schönenberger, Lisa, et al.
Published: (2025)

Accelerated Objective Gap and Gradient Norm Convergence for Gradient Descent via Long Steps
by: Grimmer, Benjamin, et al.
Published: (2024)

Composing Optimized Stepsize Schedules for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms
by: Yoon, TaeHo, et al.
Published: (2025)

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

Polynomial and Parallelizable Preconditioning for Block Tridiagonal Positive Definite Matrices
by: Yang, Shaohui, et al.
Published: (2025)

An Elementary Proof of the Near Optimality of LogSumExp Smoothing
by: Samakhoana, Thabo, et al.
Published: (2025)

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

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)

Adaptive Acceleration Without Strong Convexity Priors Or Restarts
by: Cavalcanti, Joao V., et al.
Published: (2025)

Almost-sharp $O(k^{-1} \log k)$ convergence rate for the Sinkhorn algorithm in the asymptotically scalable case
by: Wang, Guillaume
Published: (2026)

Importance sampling-based gradient method for dimension reduction in Poisson log-normal model
by: Batardière, Bastien, et al.
Published: (2024)

Parallelizable Parametric Nonlinear System Identification via tuning of a Moving Horizon State Estimator
by: Simpson, Léo, et al.
Published: (2024)

Parallelizable Riemannian Alternating Direction Method of Multipliers for Non-convex Pose Graph Optimization
by: Chen, Xin, et al.
Published: (2026)

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

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

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

A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\tilde{\mkern1mu O}(ε^{-5/3})$ Global Rate
by: Xiong, Sichao, et al.
Published: (2026)

A Parallelizable Quaternion Higher-Order Singular Value Decomposition with Applications
by: Ya, Hanxin, et al.
Published: (2023)

A Parameter-Free Stochastic LineseArch Method (SLAM) for Minimizing Expectation Residuals
by: Wang, Qi, et al.
Published: (2025)

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

On the Relation Between LP Sharpness and Limiting Error Ratio and Complexity Implications for Restarted PDHG
by: Xiong, Zikai, et al.
Published: (2023)

Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programming
by: Huang, Yicheng, et al.
Published: (2024)

Computational Guarantees for Restarted PDHG for LP based on "Limiting Error Ratios" and LP Sharpness
by: Xiong, Zikai, et al.
Published: (2023)

$\texttt{immrax}$: A Parallelizable and Differentiable Toolbox for Interval Analysis and Mixed Monotone Reachability in JAX
by: Harapanahalli, Akash, et al.
Published: (2024)