Scholarlink

<p>This paper is devoted to the study of an inertial accelerated primal–dual algorithm, which is based on a second-order differential system with time scaling, for solving a non-smooth convex optimization problem with linear equality constraints. We first introduce a second-order differential system with time scaling associated with the non-smooth convex optimization problem, and then obtain fast convergence rates for the primal–dual gap, the feasibility violation, and the objective residual along the trajectory generated by this system. Subsequently, based on the setting of the parameters involved, we propose an inertial accelerated primal–dual algorithm from the time discretization of this system. We also establish fast convergence rates for the primal–dual gap, the feasibility violation, and the objective residual. Furthermore, we demonstrate the efficacy of the proposed algorithm through numerical experiments.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Inertial Accelerated Primal–Dual Algorithms for Non-smooth Convex Optimization Problems with Linear Equality Constraints

  • 期刊论文

  • 发表日期：

    2026年4月28日

查看全文
  • Huan Zhang,
  • Xiangkai Sun,
  • Shengjie Li,
  • Kok Lay Teo

摘要

This paper is devoted to the study of an inertial accelerated primal–dual algorithm, which is based on a second-order differential system with time scaling, for solving a non-smooth convex optimization problem with linear equality constraints. We first introduce a second-order differential system with time scaling associated with the non-smooth convex optimization problem, and then obtain fast convergence rates for the primal–dual gap, the feasibility violation, and the objective residual along the trajectory generated by this system. Subsequently, based on the setting of the parameters involved, we propose an inertial accelerated primal–dual algorithm from the time discretization of this system. We also establish fast convergence rates for the primal–dual gap, the feasibility violation, and the objective residual. Furthermore, we demonstrate the efficacy of the proposed algorithm through numerical experiments.