Efficient iteration method for saddle point problems

An algorithm that is a modification of Hermitian and skew-Hermitian splitting is considered 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 efficiency of the method when it is used to solve problems of the given class.