On geometrical properties of preconditioners in IPMs for classes of block-angular problems
Document typeExternal research report
Rights accessOpen Access
One of the most efficient interior-point methods for some classes of block-angular structured problems solves the normal equations by a combination of Cholesky factorizations and preconditioned conjugate gradient for, respectively, the block and linking constraints. In this work we show that the choice of a good preconditioner depends on geometrical properties of the constraints structure. In particular, it is seen that the principal angles between the subspaces generated by the diagonal blocks and the linking constraints can be used to estimate ex-ante the efficiency of the preconditioner. Numerical validation is provided with some generated optimization problems. An application to the solution of multicommodity network flow problems with nodal capacities and equal flows of up to 127 million of variables and up to 7.5 million of constraints is also presented
J. Castro, S. Nasini, On geometrical properties of preconditioners in IPMs for classes of block-angular problems, Research Report DR 2016/03, Dept. of Statistics and Operations Research, Universitat Politècnica de Catalunya, 2016.
CitationCastro, J., Nasini, S. "On geometrical properties of preconditioners in IPMs for classes of block-angular problems". 2016.
Is part ofDR2016-03
URL other repositoryhttp://www-eio.upc.es/~jcastro/publications/reports/dr2016-03.pdf