Cover Image

Anderson Acceleration Without Restart: A Novel Method with $n$-Step Super Quadratic Convergence Rate

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ye, Haishan, Lin, Dachao, Chang, Xiangyu, Zhang, Zhihua
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Convergence of Policy in Unregularized Policy Mirror Descent
by: Lin, Dachao, et al.
Published: (2022)

On the Convergence of Projected Policy Gradient for Any Constant Step Sizes
by: Liu, Jiacai, et al.
Published: (2023)

Optimal Decentralized Composite Optimization for Convex Functions
by: Ye, Haishan, et al.
Published: (2023)

Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?
by: Ye, Haishan, et al.
Published: (2025)

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

A Unified Zeroth-Order Optimization Framework via Oblivious Randomized Sketching
by: Ye, Haishan, et al.
Published: (2025)

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

Anderson Acceleration for Linearly Converging SQP-Type Methods
by: Frey, Jonathan, et al.
Published: (2026)

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

High-Probability Guarantees for Random Zeroth-Order Gradient Descent on Smooth Functions
by: Ye, Haishan
Published: (2026)

High-Probability Guarantees for Random Zeroth-Order (Stochastic) Gradient Descent
by: Ye, Haishan
Published: (2026)

Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm
by: Wirth, Elias, et al.
Published: (2025)

Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method
by: Wang, Zepeng, et al.
Published: (2025)

Accelerated Affine-Invariant Convergence Rates of the Frank-Wolfe Algorithm with Open-Loop Step-Sizes
by: Wirth, Elias, et al.
Published: (2023)

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

Adaptive Multilevel Newton: A Quadratically Convergent Optimization Method
by: Tsipinakis, Nick, et al.
Published: (2023)

A Quadratically Convergent Alternating Projection Method for Nonconvex Sets
by: Xiao, Nachuan, et al.
Published: (2025)

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
by: Alkousa, Mohammad, et al.
Published: (2024)

Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithm on Stochastic Smooth Functions
by: Ye, Haishan
Published: (2025)

Why Does Adaptive Zeroth-Order Optimization Work?
by: Ye, Haishan, et al.
Published: (2026)

Double Variance Reduction: A Smoothing Trick for Composite Optimization Problems without First-Order Gradient
by: Di, Hao, et al.
Published: (2024)

Smoothing Accelerated Proximal Gradient Method with Fast Convergence Rate for Nonsmooth Multi-objective Optimization
by: Huang, Chengzhi
Published: (2023)

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

Second-Order Bilevel Optimization with Accelerated Convergence Rates
by: Yang, Sheng, et al.
Published: (2026)

On the Convergence of the Accelerated Riccati Iteration Method
by: Rajasingam, Prasanthan, et al.
Published: (2017)

Convergence Analysis of Stochastic Accelerated Gradient Methods for Generalized Smooth Optimizations
by: Yu, Chenhao, et al.
Published: (2025)

A Globally Convergent Policy Gradient Method for Linear Quadratic Gaussian (LQG) Control
by: Sadamoto, Tomonori, et al.
Published: (2023)

Inexact Augmented Lagrangian Methods for Conic Programs: Quadratic Growth and Linear Convergence
by: Liao, Feng-Yi, et al.
Published: (2024)

Anderson Accelerated Operator Splitting Methods for Convex-nonconvex Regularized Problems
by: Heng, Qiang, et al.
Published: (2025)

Global Convergence of Policy Gradient Methods for ReLU Controllers in Linear Quadratic Regulation
by: Rodriguez-Gil, Jhojan A., et al.
Published: (2026)

Multilevel Regularized Newton Methods with Fast Convergence Rates
by: Tsipinakis, Nick, et al.
Published: (2024)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)

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

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

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

Anderson Accelerated Feasible Sequential Linear Programming
by: Kiessling, David, et al.
Published: (2022)

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)

Theoretical Analysis on how Learning Rate Warmup Accelerates Convergence
by: Liu, Yuxing, et al.
Published: (2025)

On the Convergence Rate of MCTS for the Optimal Value Estimation in Markov Decision Processes
by: Chang, Hyeong Soo
Published: (2024)

Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
by: Yu, Yaxin, et al.
Published: (2026)