A step-free primal-dual algorithm for solving bilinear saddle point problem

DOI10.12286/JSSX.J2024-1258MaRDI QIDQ7231714zbMATH OpenFDO

Authors Long Xu, Xiaokai Chang

Publication date 22 April 2026

Published in Mathematica Numerica Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.12286/JSSX.J2024-1258

zbMATH Keywords

bilinear saddle point problemfree stepsizeprimal dual algorithmsplitting preconditioned

Mathematics Subject Classification ID

Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10)

Cites work

• A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A first-order primal-dual algorithm with linesearch
• A golden ratio primal-dual algorithm for structured convex optimization
• Acceleration of primal-dual methods by preconditioning and simple subproblem procedures
• Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
• Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
• First-order methods in optimization
• Golden ratio algorithms for variational inequalities
• Golden ratio primal-dual algorithm with linesearch
• GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm
• scientific article; zbMATH DE number 3574917 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• On convergence of the Arrow-Hurwicz method for saddle point problems
• On the ergodic convergence rates of a first-order primal-dual algorithm
• Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Stochastic primal-dual hybrid gradient algorithm with adaptive step sizes
• The linearized alternating direction method of multipliers for Dantzig selector

This page was built for publication: A step-free primal-dual algorithm for solving bilinear saddle point problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231714)