No abstract uploaded!

No abstract uploaded!

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 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.

No abstract uploaded!

Given a compact set of real numbers, a random $C^{m + \alpha}$ -diffeomorphism is constructed such that the image of any measure concentrated on the set and satisfying a certain condition involving a real number $s$ , almost surely has Fourier dimension greater than or equal to $s / (m + \alpha)$ . This is used to show that every Borel subset of the real numbers of Hausdorff dimension $s$ is $C^{m + \alpha}$ -equivalent to a set of Fourier dimension greater than or equal to $s / (m + \alpha )$ . In particular every Borel set is diffeomorphic to a Salem set, and the Fourier dimension is not invariant under $C^{m}$ -diffeomorphisms for any $m$ .