Ouyang, WenqingPeng, YueYao, YuxinZhang, JuyongDeng, BailinJacobson, Alec and Huang, Qixing2020-07-052020-07-0520201467-8659https://doi.org/10.1111/cgf.14081https://diglib.eg.org:443/handle/10.1111/cgf14081The alternating direction multiplier method (ADMM) is widely used in computer graphics for solving optimization problems that can be nonsmooth and nonconvex. It converges quickly to an approximate solution, but can take a long time to converge to a solution of high-accuracy. Previously, Anderson acceleration has been applied to ADMM, by treating it as a fixed-point iteration for the concatenation of the dual variables and a subset of the primal variables. In this paper, we note that the equivalence between ADMM and Douglas-Rachford splitting reveals that ADMM is in fact a fixed-point iteration in a lower-dimensional space. By applying Anderson acceleration to such lower-dimensional fixed-point iteration, we obtain a more effective approach for accelerating ADMM. We analyze the convergence of the proposed acceleration method on nonconvex problems, and verify its effectiveness on a variety of computer graphics including geometry processing and physical simulation.Attribution 4.0 International LicenseMathematics of computingSolversMathematical optimizationNumerical analysis10.1111/cgf.14081221-239