A study of preconditioners for network interior point methods

J. J. Judice (Joaquim.Judiceco.it.pt)
J. M. Patricio (Joao.Patricioco.it.pt)
L. F. Portugal ()
M. G. C. Resende (mgcrresearch.att.com)
G. Veiga (gveigayahoo.com)

Abstract: We study and compare preconditioners available for network interior point methods. We derive upper bounds for the condition number of the preconditioned matrices used in the solution of systems of linear equations defining the algorithm search directions. The preconditioners are tested using PDNET, a state-of-the-art interior point code for the minimum cost network flow problem. A computational comparison using a set of standard problems improves the understanding of the effectiveness of preconditioners in network interior point methods.

Keywords: Interior point method, linear programming, network flows, conjugate gradient, pr

Category 1: Network Optimization

Citation: AT&T Labs Research Technical Report AT&T Shannon Laboratory 180 Park Avenue Florham Park, NJ 07932 USA April 2001

Download: [PDF]

Entry Submitted: 04/24/2001
Entry Accepted: 04/30/2001
Entry Last Modified: 07/22/2002

Modify/Update this entry