A unified differential equation solver approach for separable convex optimization: splitting, acceleration and nonergodic rate

Abstract

This paper provides a self-contained ordinary differential equation solver approach for separable convex optimization problems. A novel primal-dual dynamical system with built-in time rescaling factors is introduced, and the exponential decay of a tailored Lyapunov function is established. Then several time discretizations of the continuous model are considered and analyzed via a unified discrete Lyapunov function. Moreover, two families of accelerated proximal alternating direction methods of multipliers are obtained, and nonergodic optimal mixed-type convergence rates shall be proved for the primal objective residual, the feasibility violation and the Lagrangian gap. Finally, numerical experiments are provided to validate the practical performances.

References in corpus (7)

• Faster convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions
• On the Global Linear Convergence of the ADMM with Multi-Block Variables
• First order optimization methods based on Hessian-driven Nesterov accelerated gradient flow
• An $O(s^r)$-Resolution ODE Framework for Understanding Discrete-Time Algorithms and Applications to the Linear Convergence of Minimax Problems
• Accelerated differential inclusion for convex optimization
• Inertial primal-dual methods for linear equality constrained convex optimization problems
• Perturbed primal-dual dynamics with damping and time scaling coefficients for affine constrained convex optimization problems