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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Numerical algorithms Ročník 100; číslo 3; s. 937 - 962
Hlavní autoři:	Chang, Xiaokai, Xu, Long, Cao, Jianxiong
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.11.2025 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!