Pith. sign in

REVIEW 1 cited by

Tikhonov regularized inertial primal-dual dynamics for convex-concave bilinear saddle point problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.05301 v1 pith:OQ3W2LAI submitted 2024-09-09 math.OC

classification math.OC
keywords parameterregularizationbilinearconvergenceconvex-concavedynamicalpointprimal-dual
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, for a convex-concave bilinear saddle point problem, we propose a Tikhonov regularized second-order primal-dual dynamical system with slow damping, extrapolation and general time scaling parameters. Depending on the vanishing speed of the rescaled regularization parameter (i.e., the product of Tikhonov regularization parameter and general time scaling parameter), we analyze the convergence properties of the trajectory generated by the dynamical system. When the rescaled regularization parameter decreases rapidly to zero, we obtain convergence rates of the primal-dual gap and velocity vector along the trajectory generated by the dynamical system. In the case that the rescaled regularization parameter tends slowly to zero, we show the strong convergence of the trajectory towards the minimal norm solution of the convex-concave bilinear saddle point problem. Further, we also present some numerical experiments to illustrate the theoretical results.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Nesterov acceleration for strongly convex-strongly concave bilinear saddle point problems: discrete and continuous-time approaches

    math.OC 2025-09 conditional novelty 5.0 of 10

    A Nesterov-accelerated primal-dual gradient algorithm and its continuous-time analogue achieve O((1 - min{sqrt(mu_F/L_F), sqrt(mu_G/L_G)})^k) convergence for strongly convex-strongly concave bilinear saddle point problems.

Pith tools