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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Adler, N. Karmarkar, M. Resende, and G. Veiga, “Data structures and programming techniques for the implementation of Karmarkar's algorithm,” ORSA Journal on Computing, vol. 1, pp. 84–106, 1989.
N.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall: Englewood Cliffs, NJ, 1993.
O. Axelsson, Iterative Solution Methods, Cambridge: Cambridge University Press, 1994.
V. Baryamureeba and T. Steihaugh, “On the convergence of an inexact primal-dual interior point method for linear programming,” Technical report, Department of Informatics-University of Bergen, Bergen-Norway, 2000.
S. Bellavia and M. Maconni, “An inexact interior-point method for monotone NCP,” Technical report, University of Firenze, Italy, 1999.
R.S. Dembo, S.C. Eisenstat, and T. Steihaug, “Inexact newton methods,” SIAM Journal on Numerical Analysis, vol. 19, pp. 400–408, 1982.
R.S. Dembo and T. Steihaug, “Truncated-Newton algorithms for large scale unconstrained optimization,” Mathematical Programming, vol. 26, pp. 190–212, 1983.
A. Fiacco and G. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Technique, Wiley: New York, 1968.
R. Freund, F. Jarre, and S. Mizuno, “Convergence of a class of inexact interior-point algorithms for linear programs,” Technical report, Lucent Technologies, 600 Mountain Avenue, Murray Hill, New Jersey 07974, USA, 1996.
G. Golub and C. van Loan, Matrix Computations, The Johns Hopkins University Press: Baltimore, MD, 1989.
O. Guler, D. den Hertog, C. Roos, T. Terlaky, and T. Tsuchiya, “Degeneracy in interior point methods for linear programming: A survey,” Annals of Operations Research, vol. 46, pp. 107–138, 1993.
D. Johnson and C. McGeoch (Eds.). Network Flows and Matching: First DIMACS Implementation Challenge, vol. 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1993.
M. Kojima, N. Megiddo, and S. Mizuno, “A primal-dual infeasible-interior-point algorithm for linear programming,” Mathematical Programming, vol. 61, pp. 263–280, 1993.
K. McShane, C. Monma, and D. Shanno, “An implementation of a primal-dual interior point method for linear programming,” ORSA Journal on Computing, vol. 1, pp. 70–83, 1989.
N. Megiddo, “Pathways to the optimal set in linear programming,” in Progress in Mathematical Programming, Interior Point and Related Methods, N. Megiddo (Ed.), Springer: New York, 1989, pp. 131–158.
L. Adams and J. Nazareth (Eds.), SIAM, Philadelphia, 1996, pp. 124–142.
S. Mizuno and F. Jarre, “Global and polynomial time convergence of an infeasible interior point algorithm using inexact computation,” Research Memorandum 605, Institute of Statistical Mathematics, Tokyo, USA, 1996.
L. Portugal, F. Bastos, J. Judice, J. Paixão, and T. Terlaky, “An investigation of interior point algorithms for the linear transportation problem,” SIAM Journal on Scientific Computing, vol. 17, pp. 1202–1223, 1996.
L. Portugal, M. Resende, G. Veiga, and J. Judice, “A truncated primal-infeasible dual-feasible interior point network flow method,” Networks, vol. 35, pp. 91–108, 2000.
M. Resende and G. Veiga, “An efficient implementation of a network interior point method,” in Network Flows and Matching: First DIMACS Implementation Challenge, D.S. Johnson and C.C. McGeoch (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 12, American Mathematical Society, pp. 299–348, 1993a.
M. Resende and G. Veiga, “An implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapacitated networks,” SIAM Journal on Optimization, vol. 3, pp. 516–537, 1993b.
A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons: New York, 1986.
S. Wright, “Stability of linear algebra computations in interior point methods for linear programming,” Preprint ANL/MCS-P446-0694, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, USA, 1994.
S. Wright, “Modified cholesky factorizations in interior point algorithms for linear programming,” Preprint ANL/MCS-P600-0596, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, USA, 1996.
S. Wright, Primal Dual Interior Point Methods. SIAM: Philaldelphia, 1997.
Q.-J. Yeh, “A reduced dual affine scaling algorithm for solving assignment and transportation problems,” Ph.D. Thesis, Columbia University, New York, 1989.
Y. Zhang, “On the convergenvce of a class of infeasible interior point methods for the horizontal linear complementarity problem,” SIAM Journal on Optimization, vol. 4, pp. 208–227, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Júdice, J.J., Patricio, J., Portugal, L.F. et al. A Study of Preconditioners for Network Interior Point Methods. Computational Optimization and Applications 24, 5–35 (2003). https://doi.org/10.1023/A:1021882330897
Issue Date:
DOI: https://doi.org/10.1023/A:1021882330897