arXiv Analytics

Sign in

arXiv:2109.13467 [math.OC]AbstractReferencesReviewsResources

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

Hao Luo, Zihang Zhang

Published 2021-09-28, updated 2023-04-25Version 2

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.

Related articles: Most relevant | Search more
arXiv:2408.06884 [math.OC] (Published 2024-08-13)
Tikhonov regularization of second-order plus first-order primal-dual dynamical systems for separable convex optimization
arXiv:1203.3742 [math.OC] (Published 2012-03-16, updated 2012-09-20)
Path-Following Gradient-Based Decomposition Algorithms For Separable Convex Optimization
arXiv:1608.08000 [math.OC] (Published 2016-08-29)
A Survey of Algorithms for Separable Convex Optimization with Linear Ascending Constraints