Accelerating ADMM for Efficient Simulation and Optimization
Juyong Zhang, Yue Peng, Wenqing Ouyang, Bailin Deng

TL;DR
This paper introduces an Anderson acceleration method to speed up ADMM, improving convergence in both convex and certain non-convex optimization problems common in computer graphics applications.
Contribution
It extends ADMM acceleration using Anderson acceleration, including convergence analysis for specific non-convex problems in graphics.
Findings
Significant reduction in convergence time for various graphics optimization tasks
Theoretical proof of ADMM convergence on certain non-convex problems
Enhanced efficiency in physical simulation and geometry processing
Abstract
The alternating direction method of multipliers (ADMM) is a popular approach for solving optimization problems that are potentially non-smooth and with hard constraints. It has been applied to various computer graphics applications, including physical simulation, geometry processing, and image processing. However, ADMM can take a long time to converge to a solution of high accuracy. Moreover, many computer graphics tasks involve non-convex optimization, and there is often no convergence guarantee for ADMM on such problems since it was originally designed for convex optimization. In this paper, we propose a method to speed up ADMM using Anderson acceleration, an established technique for accelerating fixed-point iterations. We show that in the general case, ADMM is a fixed-point iteration of the second primal variable and the dual variable, and Anderson acceleration can be directly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Matrix Theory and Algorithms · Numerical methods in inverse problems
