2015
DOI: 10.1134/s2070048215040055
|View full text |Cite
|
Sign up to set email alerts
|

Efficient iteration method for saddle point problems

Abstract: An algorithm that is a modification of Hermitian and skew Hermitian splitting is consid ered to be used to solve a large system of linear algebraic equations with a saddle point. The method is applied to solve constrained optimization problems. The numerical experiments show the high effi ciency of the method when it is used to solve problems of the given class.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 13 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?