Using constraint preconditioners with regularized saddle-point problems

H.S. Dollar, N.I.M. Gould, W.H.A. Schilders, A.J. Wathen

Research output: Contribution to journalArticleAcademicpeer-review

20 Citations (Scopus)
2 Downloads (Pure)


The problem of finding good preconditioners for the numerical solution of a certain important class of indefinite linear systems is considered. These systems are of a 2 by 2 block (KKT) structure in which the (2,2) block (denoted by -C) is assumed to be nonzero. In Constraint preconditioning for indefinite linear systems, SIAM J. Matrix Anal. Appl. 21 (2000), Keller, Gould and Wathen introduced the idea of using constraint preconditioners that have a specific 2 by 2 block structure for the case of C being zero. We shall give results concerning the spectrum and form of the eigenvectors when a preconditioner of the form considered by Keller, Gould and Wathen is used but the system we wish to solve may have C ¿0. In particular, the results presented here indicate clustering of eigenvalues and, hence, faster convergence of Krylov subspace iterative methods when the entries of C are small; such a situations arise naturally in interior point methods for optimization and we present results for such problems which validate our conclusions.
Original languageEnglish
Pages (from-to)249-270
JournalComputational Optimization and Applications
Issue number2-3
Publication statusPublished - 2007


Dive into the research topics of 'Using constraint preconditioners with regularized saddle-point problems'. Together they form a unique fingerprint.

Cite this