A study of preconditioners for network interior point methods

Computational Optimization and Applications

Volumn 24, Issue 1, 2003, Pages 5-35

  Júdice, Joaquim J ^a   Patricio, João ^b   Portugal, Luis F ^a   Resende, Mauricio G C ^c   Veiga, Geraldo ^d  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b Escola Superior de Tecnologia de Tomar   (Portugal)

^c AT AND T LABS RESEARCH   (United States)

^d NONE

Author keywords

Conjugate gradient; Experimental testing of algorithms; Interior point method; Linear programming; Network flows; Preconditioners

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; PROBLEM SOLVING;

CONJUGATE GRADIENTS;

COMPUTATIONAL METHODS;

EID: 0037268379     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021882330897     Document Type: Article

References (27)

1. 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.
2. N.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall: Englewood Cliffs, NJ, 1993.
3. O. Axelsson, Iterative Solution Methods, Cambridge: Cambridge University Press, 1994.
4. 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.
5. S. Bellavia and M. Maconni, "An inexact interior-point method for monotone NCP," Technical report, University of Firenze, Italy, 1999.
6. R.S. Dembo, S.C. Eisenstat, and T. Steihaug, "Inexact newton methods," SIAM Journal on Numerical Analysis, vol. 19, pp. 400-408, 1982.
7. R.S. Dembo and T. Steihaug, "Truncated-Newton algorithms for large scale unconstrained optimization," Mathematical Programming, vol. 26, pp. 190-212, 1983.
8. A. Fiacco and G. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Technique, Wiley: New York, 1968.
9. 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.
10. G. Golub and C. van Loan, Matrix Computations, The Johns Hopkins University Press: Baltimore, MD, 1989.
11. O. Güler, 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.
12. 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.
13. 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.
14. 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.
15. 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.
16. L. Adams and J. Nazareth (Eds.), SIAM, Philadelphia, 1996, pp. 124-142.
17. 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.
18. L. Portugal, F. Bastos, J. Júdice, 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.
19. L. Portugal, M. Resende, G. Veiga, and J. Júdice, "A truncated primal-infeasible dual-feasible interior point network flow method," Networks, vol. 35, pp. 91-108, 2000.
20. 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.
21. 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.
22. A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons: New York, 1986.
23. 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.
24. 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.
25. S. Wright, Primal Dual Interior Point Methods. SIAM: Philaldelphia, 1997.
26. Q.-J. Yeh, "A reduced dual affine scaling algorithm for solving assignment and transportation problems," Ph.D. Thesis, Columbia University, New York, 1989.
27. 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.