General-purpose preconditioning for regularized interior point methods
Jacek Gondzio (),
Spyridon Pougkakiotis () and
John W. Pearson ()
Additional contact information
Jacek Gondzio: University of Edinburgh
Spyridon Pougkakiotis: Yale University
John W. Pearson: University of Edinburgh
Computational Optimization and Applications, 2022, vol. 83, issue 3, No 2, 727-757
Abstract In this paper we present general-purpose preconditioners for regularized augmented systems, and their corresponding normal equations, arising from optimization problems. We discuss positive definite preconditioners, suitable for CG and MINRES. We consider “sparsifications" which avoid situations in which eigenvalues of the preconditioned matrix may become complex. Special attention is given to systems arising from the application of regularized interior point methods to linear or nonlinear convex programming problems.
Keywords: Preconditioning; Krylov subspace methods; Interior point methods; Regularization; Saddle point systems; Convex optimization (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s10589-022-00424-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:83:y:2022:i:3:d:10.1007_s10589-022-00424-5
Ordering information: This journal article can be ordered from
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().