We consider the application of the type-I Anderson acceleration to solving general
nonsmooth fixed-point problems. By interleaving with safeguarding steps and employing a …

This paper provides theoretical justification that Anderson acceleration (AA) improves the
convergence rate of contractive fixed-point iterations in the vicinity of a fixed-point. AA has …

Many computer graphics problems require computing geometric shapes subject to certain
constraints. This often results in non-linear and non-convex optimization problems with …

A one-step analysis of Anderson acceleration with general algorithmic depths is presented.
The resulting residual bounds within both contractive and noncontractive settings reveal the …

We present a novel algorithm for computing best uniform rational approximations to real
scalar functions in the setting of zero defect. The method, dubbed BRASIL (best rational …

This paper presents a general framework for Shanks transformations of sequences of
elements in a vector space. It is shown that Minimal Polynomial Extrapolation (MPE) …

Anderson acceleration is a well-established and simple technique for speeding up fixed-
point computations with countless applications. This work introduces novel methods for …

The expectation-maximization (EM) algorithm is a well-known iterative method for computing
maximum likelihood estimates in a variety of statistical problems. Despite its numerous …

This paper considers the effect of Anderson acceleration (AA) on the convergence order of
nonlinear solvers in fixed point form xk+ 1= g (xk), that are looking for a fixed point x∗ of g …

The alternating direction multiplier method (ADMM) is widely used in computer graphics for
solving optimization problems that can be nonsmooth and nonconvex. It converges quickly …