Fetching the paper…
Reading the bibliography…
We consider the application of the type-I Anderson acceleration to solving general non-smooth fixed-point problems.
A Markovian decision process
R. Bellman · 1957
Earlier work this paper cites.
Iterative procedures for nonlinear integral equations
D. G. Anderson · 1965
Earlier work this paper cites.
A class of methods for solving nonlinear simultaneous equations
C. G. Broyden · 1965
Earlier work this paper cites.
A hybrid method for nonlinear equations
M. JD. Powell · 1970
Earlier work this paper cites.
On the global convergence of Broyden’s method
J. J. Moré and J. A. Trangenstein · 1976
Earlier work this paper cites.
Solving systems of nonlinear equations by Broyden’s method with projected updates
D. M. Gay and R. B. Schnabel · 1978
Earlier work this paper cites.
Convergence acceleration of iterative sequences. the case of SCF iterations
P. Pulay · 1980
Earlier work this paper cites.
Improved SCF convergence
P. Pulay · 1982
Earlier work this paper cites.
Linear and nonlinear programming
D. G. Luenberger and Y. Ye · 1984
Earlier work this paper cites.
Newton’s method for B-differentiable equations
J. S. Pang · 1990
Earlier work this paper cites.
Local convergence of quasi-Newton methods for B-differentiable equations
C. M. Ip and J. Kyparisis · 1992
Earlier work this paper cites.
Stable multipoint secant methods with released requirements to points position
O. Burdakov and U. Felgenhauer · 1994
Earlier work this paper cites.
An O( n L \sqrt{n}{L} )-iteration homogeneous and self-dual linear programming algorithm
Y. Ye, M. J. Todd, and S. Mizuno · 1994
Earlier work this paper cites.
An efficient algorithm for minimizing a sum of euclidean norms with applications
G. Xue and Y. Ye · 1997
Earlier work this paper cites.
A derivative-free line search and DFP method for symmetric equations with global and superlinear convergence
D. Li and M. Fukushima · 1999
Earlier work this paper cites.
A globally and superlinearly convergent Gauss-Newton-based BFGS method for symmetric nonlinear equations
D. Li and M. Fukushima · 1999
Earlier work this paper cites.
A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
D. Li and M. Fukushima · 2000
Earlier work this paper cites.
Quasi-Fejérian analysis of some optimization algorithms
P. L. Combettes · 2001
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Regularization and variable selection via the elastic net
H. Zou and T. Hastie · 2005
Earlier work this paper cites.
Limited memory BFGS method for nonlinear monotone equations
W. Zhou and D. Li · 2007
Earlier work this paper cites.
The Sinkhorn-Knopp algorithm: convergence and applications
P. A. Knight · 2008
Earlier work this paper cites.
A globally convergent BFGS method for nonlinear monotone equations without any merit functions
W. Zhou and D. Li · 2008
Earlier work this paper cites.
Two classes of multisecant methods for nonlinear acceleration
H. Fang and Y. Saad · 2009
Earlier work this paper cites.
Convex analysis and monotone operator theory in Hilbert spaces
H. H. Bauschke and P. L. Combettes · 2010
Cited alongside, same era.
Nonnegativity constraints in numerical analysis
D. Chen and R. J. Plemmons · 2010
Cited alongside, same era.
Accelerating self-consistent field convergence with the augmented Roothaan-Hall energy function
X. Hu and W. Yang · 2010
Cited alongside, same era.
Near-optimal regret bounds for reinforcement learning
T. Jaksch, R. Ortner, and P. Auer · 2010
Cited alongside, same era.
Cs726-Lyapunov analysis and the heavy ball method
B. Recht · 2010
Cited alongside, same era.
An analysis for the DIIS acceleration method used in quantum chemistry calculations
T. Rohwedder and R. Schneider · 2011
Cited alongside, same era.
Steady-state Anderson accelerated coupling of lattice boltzmann and navier–stokes solvers
A. Atanasov, B. Uekermann, C. A. P. Mejía, H. J. Bungartz, and P. Neumann · 2016
Later among the works it cites.
Periodic Pulay method for robust and efficient convergence acceleration of self-consistent field iterations
A. S. Banerjee, P. Suryanarayana, and J. E. Pask · 2016
Later among the works it cites.
Line search for averaged operator iteration
P. Giselsson, M. Fält, and S. Boyd · 2016
Later among the works it cites.
Anderson acceleration of the alternating projections method for computing the nearest correlation matrix
N. J. Higham and Nataša Strabić · 2016
Later among the works it cites.
Conic optimization via operator splitting and homogeneous self-dual embedding
B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd · 2016
Later among the works it cites.
Primer on monotone operator methods
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Anderson acceleration for fixed-point iterations
H. F. Walker and P. Ni · 2011
Cited alongside, same era.
Lecture 6: Matrix norms and spectral radii, http://www.math.drexel.edu/~foucart/TeachingFiles/F12/M504Lect6.pdf
S. Foucart · 2012
Cited alongside, same era.
Broyden updating, the good and the bad!
A. Griewank · 2012
Cited alongside, same era.
Monotone operator methods for Nash equilibria in non-potential games
L. M. Briceno-Arias and P. L. Combette · 2013
Cited alongside, same era.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2013
Cited alongside, same era.
(More) efficient reinforcement learning via posterior sampling
I. Osband, D. Russo, and B. Van Roy · 2013
Cited alongside, same era.
E. K. Ryu and S. Boyd · 2016
Later among the works it cites.
Regularized nonlinear acceleration
D. Scieur, A. d’Aspremont, and F. Bach · 2016
Later among the works it cites.
Supermann: a superlinearly convergent algorithm for finding fixed points of nonexpansive operators
A. Themelis and P. Patrinos · 2016
Later among the works it cites.
13. Douglas-Rachford method and ADMM
L. Vandenberghe · 2016
Later among the works it cites.
A regularized semi-smooth Newton method with projection steps for composite convex programs
X. Xiao, Y. Li, Z. Wen, and L. Zhang · 2016
Later among the works it cites.
Anderson acceleration and application to the three-temperature energy equations
H. An, X. Jia, and H. F. Walker · 2017
Later among the works it cites.
A semismooth Newton method for fast, generic convex programming
A. Ali, E. Wong, and J. Z. Kolter · 2017
Later among the works it cites.
O. Burdakov and A. Kamandi · 2017
Later among the works it cites.
Anderson acceleration method of finding steady-state particle size distribution for a wide class of aggregation–fragmentation models
S. A. Matveev, V. I. Stadnichuk, E. E. Tyrtyshnikov, A. P. Smirnov, N.V. Ampilogova, and N. V. Brilliantov · 2017
Later among the works it cites.
SCS: Splitting conic solver, version 2.0.2
B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd · 2017
Later among the works it cites.
AA-ICP: Iterative closest point with Anderson acceleration
A. L. Pavlov, G. V. Ovchinnikov, D. Yu Derbyshev, D. Tsetserukou, and I. V. Oseledets · 2017
Later among the works it cites.
Nonlinear acceleration of stochastic algorithms
D. Scieur, F. Bach, and A. d’Aspremont · 2017
Later among the works it cites.
Local improvement results for Anderson acceleration with inaccurate function evaluations
A. Toth, J. A. Ellis, T. Evans, S. Hamilton, C. T. Kelley, R. Pawlowski, and S. Slattery · 2017
Later among the works it cites.
A rewriting system for convex optimization problems
A. Agrawal, R. Verschueren, S. Diamond, and S. Boyd · 2018
Closest in time.
N. C. Henderson and R.Varadhan · 2018
Closest in time.
Nonlinear acceleration of CNNs
D. Scieur, E. Oyallon, A. dÁspremont, and F. Bach · 2018
Closest in time.
Nonlinear acceleration of deep neural networks
D. Scieur, E. Oyallon, A. d’Aspremont, and F. Bach · 2018
Closest in time.
Fast k-means clustering with Anderson acceleration
J. Zhang, Y. Yao, Y. Peng, H. Yu, and B. Deng · 2018
Closest in time.