arXiv Analytics

Sign in

arXiv:2408.06884 [math.OC]AbstractReferencesReviewsResources

Tikhonov regularization of second-order plus first-order primal-dual dynamical systems for separable convex optimization

Xiangkai Sun, Lijuan Zheng, Kok Lay Teo

Published 2024-08-13Version 1

This paper deals with a Tikhonov regularized second-order plus first-order primal-dual dynamical system with time scaling for separable convex optimization problems with linear equality constraints. This system consists of two second-order ordinary differential equations for the primal variables and one first-order ordinary differential equation for the dual variable.By utilizing the Lyapunov analysis approach, we obtain the convergence properties of the primal-dual gap, the objective function error, the feasibility measure and the gradient norm of the objective function along the trajectory. We also establish the strong convergence of the primal trajectory generated by the dynamical system towards the minimal norm solution of the separable convex optimization problem. Furthermore, we give numerical experiments to illustrate the theoretical results, showing that our dynamical system performs better than those in the literature in terms of convergence rates.

Related articles: Most relevant | Search more
arXiv:2109.13467 [math.OC] (Published 2021-09-28, updated 2023-04-25)
A unified differential equation solver approach for separable convex optimization: splitting, acceleration and nonergodic rate
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