A fast Anderson-Chebyshev acceleration for nonlinear optimization
Anderson acceleration (or Anderson mixing) is an efficient acceleration method for fixed point iterations $x_{t+1}=G(x_t)$, e.g., gradient descent can be viewed as iteratively applying the operation $G(x) \triangleq x-\alpha\nabla f(x)$. It is known that Anderson acceleration is quite efficient in p...
Saved in:
Main Authors: | LI, Zhize, LI, Jian |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2020
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8680 https://ink.library.smu.edu.sg/context/sis_research/article/9683/viewcontent/AISTATS20_full_anderson.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A unified variance-reduced accelerated gradient method for convex optimization
by: LAN, Guanghui, et al.
Published: (2019) -
Acceleration for compressed gradient descent in distributed and federated optimization
by: LI, Zhize, et al.
Published: (2020) -
A simple proximal stochastic gradient method for nonsmooth nonconvex optimization
by: LI, Zhize, et al.
Published: (2018) -
BEER: Fast O(1/T) rate for decentralized nonconvex optimization with communication compression
by: ZHAO, Haoyu, et al.
Published: (2022) -
Tutorial: "Advances in federated optimization: Efficiency, resiliency, and privacy"
by: CHI, Yuejie, et al.
Published: (2023)