Optimization of one class of nonsymmetrizable algorithms for saddle point problems

DOI10.1515/RNAM-2002-0604MaRDI QIDQ4796487zbMATH OpenOpenAlexFDO

Authors Yu. V. Bychenkov

Publication date 17 November 2003

Published in Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/rnam-2002-0604

zbMATH Keywords

convergenceiterative methodoptimal parametersaddle point problemssuccessive overrelaxation methodsymmetric indefinite matricesArrow-Hurwicz algorithmnondegenerate systemKobelkov algorithm

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Recommendations

• scientific article; zbMATH DE number 2214311
• scientific article; zbMATH DE number 1902191
• On the iterative algorithm for large sparse saddle point problems
• Saddle point methods, and alogorithms, for non-symmetric linear equations^∗
• On the choice of almost-optimal parameters in algorithms of Arrow-Hurwicz type

Cited in

(7)

• scientific article; zbMATH DE number 2214311 (Why is no real title available?)
• scientific article; zbMATH DE number 1902191 (Why is no real title available?)
• scientific article; zbMATH DE number 4139503 (Why is no real title available?)
• Optimization of the generalized method of Hermitian and skew-Hermitian splitting iterations for solving symmetric saddle-point problems
• Some results on the convergence of the Arrow-Hurwicz algorithm for Stokes-type algebraic systems
• A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
• scientific article; zbMATH DE number 2207279 (Why is no real title available?)

This page was built for publication: Optimization of one class of nonsymmetrizable algorithms for saddle point problems

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