Proposes an inertial primal-dual algorithm obtained by discretizing a time-scaled second-order differential system, with proven fast convergence on primal-dual gap, feasibility, and objective residual for non-smooth convex problems with equality constraints.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Inertial accelerated primal-dual algorithms for non-smooth convex optimization problems with linear equality constraints
Proposes an inertial primal-dual algorithm obtained by discretizing a time-scaled second-order differential system, with proven fast convergence on primal-dual gap, feasibility, and objective residual for non-smooth convex problems with equality constraints.