Interior-point methods feature prominently among numerical methods for inequality-constrained optimization problems, and involve the need to solve a sequence of linear systems that typically become increasingly ill-conditioned with the iterations. To solve these systems, whose original form has a nonsymmetric 3x3 block structure, it is common practice to perform block Gaussian elimination and either solve the resulting reduced saddle-point system, or further reduce the system to the normal equations and apply a symmetric positive definite solver. In this paper we use energy estimates to obtain bounds on the eigenvalues of the matrices, and conclude that the original unreduced matrix has more favorable eigenvalue bounds than the alternative reduced versions. We also examine regularized variants of those matrices that allow to do away with typical regularity assumptions.
Citation
Cahier du GERAD G-2012-42, GERAD, Montreal, Canada, 2012.
Article
View Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods