A splitting preconditioned primal-dual algorithm with interpolation and extrapolation for bilinear saddle point problem

Both the popular primal-dual algorithms of Chambolle-Pock and Chang-Yang are full-splitting and efficient for solving bilinear saddle point problem. However, their step sizes depend on the spectral norm of the linear transform or are estimated by using linesearch, which are usually overconservative...

Full description

Saved in:

Bibliographic Details
Published in:	Numerical algorithms Vol. 100; no. 3; pp. 937 - 962
Main Authors:	Chang, Xiaokai, Xu, Long, Cao, Jianxiong
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2025 Springer Nature B.V
Subjects:	Algebra Algorithms Computation Computer Science Convergence Convex analysis Decomposition Euclidean space Extrapolation Interpolation Lagrange multiplier Linear transformations Numeric Computing Numerical Analysis Operators (mathematics) Preconditioning Saddle points Splitting Theory of Computation Primal-dual algorithm Bilinear saddle point problem Splitting preconditioning Sequence combination
ISSN:	1017-1398, 1572-9265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!