arXiv Analytics

Sign in

arXiv:2106.12294 [math.OC]AbstractReferencesReviewsResources

Improved convergence rates and trajectory convergence for primal-dual dynamical systems with vanishing damping

Radu Ioan Bot, Dang-Khoa Nguyen

Published 2021-06-23Version 1

In this work, we approach the minimization of a continuously differentiable convex function under linear equality constraints by a second-order dynamical system with asymptotically vanishing damping term. The system is formulated in terms of the augmented Lagrangian associated to the minimization problem. We show fast convergence of the primal-dual gap, the feasibility measure, and the objective function value along the generated trajectories. In case the objective function has Lipschitz continuous gradient, we show that the primal-dual trajectory asymptotically weakly converges to a primal-dual optimal solution of the underlying minimization problem. To the best of our knowledge, this is the first result which guarantees the convergence of the trajectory generated by a primal-dual dynamical system with asymptotic vanishing damping. Moreover, we will rediscover in case of the unconstrained minimization of a convex differentiable function with Lipschitz continuous gradient all convergence statements obtained in the literature for Nesterov's accelerated gradient method.

Related articles: Most relevant | Search more
arXiv:2209.06438 [math.OC] (Published 2022-09-14)
Time rescaling of a primal-dual dynamical system with asymptotically vanishing damping
arXiv:2209.12467 [math.OC] (Published 2022-09-26)
Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient and their monotonic transformations
arXiv:1910.10879 [math.OC] (Published 2019-10-24)
Convergence Rates of Subgradient Methods for Quasi-convex Optimization Problems