Anderson Acceleration for Nonsmooth Fixed Point Problems
Not on the map. Why?
Abstract (arXiv)
We give new convergence results of Anderson acceleration for the composite max fixed point problem. We prove that Anderson(1) and EDIIS(1) are q-linear convergent with a smaller q-factor than existing q-factors. Moreover, we propose a smoothing approximation of the composite max function in the contractive fixed point problem. We show that the smoothing approximation is a contraction mapping with the same fixed point as the composite max fixed point problem. Our results rigorously confirm that the nonsmoothness does not affect the convergence rate of Anderson acceleration method when we use the proposed smoothing approximation for the composite max fixed point problem. Numerical results for constrained minimax problems, complementarity problems and nonsmooth differential equations are presented to show the efficiency and good performance of the proposed Anderson acceleration method with smoothing approximation.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Sep 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 2.
3 papers.
- 2024Anderson Acceleration in Nonsmooth Problems: Local Convergence via Active Manifold Identification12 Oct 2024
- 2024Anderson acceleration for iteratively reweighted ℓ1 algorithm12 Mar 2024
- 2023Improved Convergence Factor of Windowed Anderson Acceleration for Symmetric Fixed-Point Iterations4 Nov 2023