Cover Image

Anderson Acceleration in Nonsmooth Problems: Local Convergence via Active Manifold Identification

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Kexin, Bai, Luwei, Wang, Xiao, Wang, Hao
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints
by: Zhu, Linglingzhi, et al.
Published: (2026)

A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints
by: Yuan, Ganzhao
Published: (2023)

Acceleration Methods
by: d'Aspremont, Alexandre, et al.
Published: (2021)

Quantitative Convergences of Lie Group Momentum Optimizers
by: Kong, Lingkai, et al.
Published: (2024)

Scalable Acceleration for Classification-Based Derivative-Free Optimization
by: Han, Tianyi, et al.
Published: (2023)

Solving Elliptic Optimal Control Problems via Neural Networks and Optimality System
by: Dai, Yongcheng, et al.
Published: (2023)

Last-Iterate Convergence of Randomized Kaczmarz and SGD with Greedy Step Size
by: Dereziński, Michał, et al.
Published: (2026)

WinQ: Accelerating Quantization-Aware Training of Language Models Around Saddle Points
by: Li, Dongyue, et al.
Published: (2026)

Convergence of Adam for Non-convex Objectives: Relaxed Hyperparameters and Non-ergodic Case
by: He, Meixuan, et al.
Published: (2023)

Lyapunov Analysis For Monotonically Forward-Backward Accelerated Algorithms
by: Fu, Mingwei, et al.
Published: (2024)

Dynamic Proximal Gradient Algorithms for Schatten-$p$ Quasi-Norm Regularized Problems
by: Shen, Weiping, et al.
Published: (2026)

Convergence of two-timescale gradient descent ascent dynamics: finite-dimensional and mean-field perspectives
by: An, Jing, et al.
Published: (2025)

On the Convergence of the Gradient Descent Method with Stochastic Fixed-point Rounding Errors under the Polyak-Lojasiewicz Inequality
by: Xia, Lu, et al.
Published: (2023)

Faster Randomized Methods for Orthogonality Constrained Problems
by: Shustin, Boris, et al.
Published: (2021)

A Family of Controllable Momentum Coefficients for Forward-Backward Accelerated Algorithms
by: Fu, Mingwei, et al.
Published: (2025)

Gradient Descent as a Perceptron Algorithm: Understanding Dynamics and Implicit Acceleration
by: Tyurin, Alexander
Published: (2025)

Learning Regularization Functionals for Inverse Problems: A Comparative Study
by: Hertrich, Johannes, et al.
Published: (2025)

Manifold-based Algorithms for the Hadamard Decomposition
by: Gillis, Nicolas, et al.
Published: (2026)

KANtrol: A Physics-Informed Kolmogorov-Arnold Network Framework for Solving Multi-Dimensional and Fractional Optimal Control Problems
by: Aghaei, Alireza Afzal
Published: (2024)

Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach
by: Farzin, Amir Ali, et al.
Published: (2026)

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
by: Lu, Zhaosong, et al.
Published: (2025)

The Dynamical Anatomy of Anderson Acceleration:From Adaptive Momentum to Variable-Mass ODEs
by: Chen, Kewang, et al.
Published: (2025)

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

Nonlinear Assimilation via Score-based Sequential Langevin Sampling
by: Ding, Zhao, et al.
Published: (2024)

Fast Unconstrained Optimization via Hessian Averaging and Adaptive Gradient Sampling Methods
by: O'Leary-Roseberry, Thomas, et al.
Published: (2024)

Improved Convergence Factor of Windowed Anderson Acceleration for Symmetric Fixed-Point Iterations
by: Garner, Casey, et al.
Published: (2023)

A distributed semismooth Newton based augmented Lagrangian method for distributed optimization
by: Ma, Qihao, et al.
Published: (2026)

Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization
by: Huang, Feihu, et al.
Published: (2023)

Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
by: Bian, Fengmiao, et al.
Published: (2025)

PRISM: Distribution-free Adaptive Computation of Matrix Functions for Accelerating Neural Network Training
by: Yang, Shenghao, et al.
Published: (2026)

Accelerated Primal-Dual Proximal Gradient Splitting Methods for Convex-Concave Saddle-Point Problems
by: Luo, Hao
Published: (2024)

DeepMartingale: Duality of the Optimal Stopping Problem with Expressivity and High-Dimensional Hedging
by: Ye, Junyan, et al.
Published: (2025)

A Natural Primal-Dual Hybrid Gradient Method for Adversarial Neural Network Training on Solving Partial Differential Equations
by: Liu, Shu, et al.
Published: (2024)

Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity
by: Li, Bowen, et al.
Published: (2023)

A Discrete Variational Derivation of Accelerated Methods in Optimization
by: Campos, Cédric M., et al.
Published: (2021)

Active-Set Identification in Noisy and Stochastic Optimization
by: Curtis, Frank E., et al.
Published: (2025)

From Cursed to Competitive: Closing the ZO-FO Gap via Input-to-State Stability
by: Farzin, Amir Ali, et al.
Published: (2026)

Convergence Analysis of Fractional Gradient Descent
by: Aggarwal, Ashwani
Published: (2023)

Constrained Density Estimation via Optimal Transport
by: Hu, Yinan, et al.
Published: (2026)

Symmetry & Critical Points for Symmetric Tensor Decomposition Problems
by: Arjevani, Yossi, et al.
Published: (2023)