Proves convergence to saddle points and o(1/t²) gap rates for continuous-time dynamics with α/t damping (α≥3) and for a structure-preserving discretization under a t_k sequence condition with ρ≤1.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fast primal-dual methods for convex-concave bilinear saddle point problems: continuous-time dynamics and discrete algorithms
Proves convergence to saddle points and o(1/t²) gap rates for continuous-time dynamics with α/t damping (α≥3) and for a structure-preserving discretization under a t_k sequence condition with ρ≤1.