Erratum to: Inexact constraint preconditioners for linear systems arising in interior point methods

Abstract Issues of indefinite preconditioning of reduced Newton systems arising in optimization with interior point methods are addressed in this paper. Constraint preconditioners have shown much promise in this context. However, there are situations in which an unfavorable sparsity pattern of Jacobian matrix may adversely affect the preconditioner and make its inverse representation unacceptably dense hence too expensive to be used in practice. A remedy to such situations is proposed in this paper. An approximate constraint preconditioner is considered in which sparse approximation of the Jacobian is used instead of the complete matrix. Spectral analysis of the preconditioned matrix is performed and bounds on its non-unit eigenvalues are provided. Preliminary computational results are encouraging.

[1]  L. Luksan,et al.  Indefinitely preconditioned inexact Newton method for large sparse equality constrained non‐linear programming problems , 1998 .

[2]  Luca Bergamaschi,et al.  Preconditioning Indefinite Systems in Interior Point Methods for Optimization , 2004, Comput. Optim. Appl..

[3]  Jacek Gondzio,et al.  Implementation of Interior Point Methods for Large Scale Linear Programming , 1996 .

[4]  Gene H. Golub,et al.  Numerical solution of saddle point problems , 2005, Acta Numerica.

[5]  R. Freund,et al.  Software for simplified Lanczos and QMR algorithms , 1995 .

[6]  Andrew J. Wathen,et al.  Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices , 2005, SIAM J. Sci. Comput..

[7]  Jan Vlcek,et al.  Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems , 1998, Numer. Linear Algebra Appl..

[8]  Michele Benzi,et al.  On the eigenvalues of a class of saddle point matrices , 2006, Numerische Mathematik.

[9]  Nicholas I. M. Gould,et al.  Constraint Preconditioning for Indefinite Linear Systems , 2000, SIAM J. Matrix Anal. Appl..

[10]  J. Gondzio.  HOPDM (version 2.12) — A fast LP solver based on a primal-dual interior point method , 1995 .

[11]  Nicholas I. M. Gould,et al.  On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization , 2001, SIAM J. Sci. Comput..

[12]  K. M. Anstreicher,et al.  Interior point methods in mathematical programming , 1996 .

[13]  Thomas F. Coleman,et al.  A Preconditioned Conjugate Gradient Approach to Linear Equality Constrained Minimization , 2001, Comput. Optim. Appl..

[14]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.