An interior point method for bordered block-diagonal linear programs

SIAM Journal on Optimization

Volumn 6, Issue 4, 1996, Pages 913-932

  Grigoriadis, Michael D ^a   Khachiyan, Leonid G ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Bordered block diagonal problems; Interior point methods; Structured linear programs

Indexed keywords

EID: 0030491877     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494263609     Document Type: Article

References (32)

1. P. BRUCKER, An O(n) algorithm for quadratic knapsack problems, Oper. Res. Lett., 3 (1984), pp. 163-166.
2. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK User's Guide, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1992.
3. J. R. BIRGE AND L. QI, Computing block-angular Karmarkar projections with applications to stochastic programming, Management Sci., 34 (1988), pp. 1472-1479.
4. I.C. CHOI AND D. GOLDFARB, Solving multicommodity network flow problems by an interior point method, in Large-Scale Numerical Optimization, Papers from the Workshop held at Cornell University, T.F. Coleman and Y. Li, eds., SIAM Proc. in Applied Math. 46, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1990, pp. 58-69.
5. D. DEN HERTOG, Interior Point Methods for Linear Programming, Master's thesis, Faculty of Math. and Informatics, Technical University, Delft, The Netherlands, 1989.
6. D. GOLDFARB AND M.J. TODD, Chapter II. Linear programming, in Handbook of OR & MS, G. Nemhauser, A. Rinnooy Kan, and M. Todd, eds., Elsevier Science (North-Holland), Amsterdam, 1989.
7. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
8. C. C. GONZAGA AND L. A. CARLOS, A Primal Affine-Scaling Algorithm for Linearly Constrained Convex Programs, Tech. report ES-238/90, Dept. of Systems Engineering and Computer Science, COPPE Federal University of Rio de Janeiro, 1990.
9. C. C. GONZAGA AND M. J. TODD, An O (√nL)-iteration large-step primal-dual affine algorithm for linear programming, SIAM J. Optim., 2 (1992), pp. 331-342.
10. L. A. HALL AND R. J. VANDERBEI, Two-Thirds Is Sharp for Affine Scaling, Tech. report 92-44, DIMACS, Rutgers University, New Brunswick, NJ, 1992.
11. J. A. KALISKI AND Y. YE, A decomposition variant of the potential reduction algorithm for linear programming, Management Sci., 39 (1993), pp. 757-776.
12. S. KAPOOR AND P.M. VAIDYA, Fast algorithms for convex quadratic programming and multicommodity flows, in Proc. of the 18th Annual ACM Symp. on Theory of Computing, Berkeley, CA, 1986, pp. 147-159.
13. _, Speeding-up Karmarkar's algorithm for multicommodity flows, Math. Programming, 73 (1996), pp. 111-127.
14. N. KARMARKAR, A new polynomial time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
15. L. G. KHACHIYAN, On the Complexity of Linear Programs, Math. and Cybernetics Series, Znanie Publishers, Moscow, 1987. (In Russian.)
16. S. MEHROTRA, Variants of Karmarkar's Algorithm: Theoretical Complexity and Practical Implementation, Ph.D. thesis, Dept. of Industrial Engineering and Operational Research, Columbia University, New York, NY, 1987.
17. _, On the implementation of a primal-dual interior point method, SIAM J. Optim., 2 (1992), pp. 575-601.
18. B. A. MURTAGH AND M. A. SAUNDERS, MINOS 5.4 User's Guide, Tech. Report SOL-83-20R, Dept. of Operational Research, Stanford University, Stanford, CA, December 1983 (rev. March 1993).
19. R. C. MONTEIRO AND I. ADLER, Interior path-following primal-dual algorithms, Math. Programming, 44 (1988), pp. 37-41.
20. YU. NESTEROV AND A. NEMIROVSKY, Self-concordant functions and polynomial time methods in convex programming, SIAM Studies in Applied Mathematics, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.
21. IBM CORPORATION, Optimization Subroutine Library (OSL) Guide and Reference, Release 2, Pub. SC23-0519-02, IBM Corp., Kingston, NY, 1991.
22. J. RENEGAR, A polynomial-time method algorithm, based on Newton's method, for linear programming, Math. Programming, 40 (1988), pp. 59-93.
23. T.R. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
24. A. SCHRIJVER, Theory of Linear and Integer Programming, John Wiley, New York, 1986.
25. M. J. TODD, Exploiting special structure in Karmarkar's algorithm for linear programming, Math. Programming, 41 (1988), pp. 97-113.
26. M. TORABI, Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems, Comput. Math. Appl., 20 (1990). pp. 1-7.
27. T. TSUCHIYA AND M. MARUMATSU, Global Convergence of the Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems, Res. Memorandum 423, The Institute of Statistical Mathematics, Tokyo, January 1992 (rev. September 1992).
28. P. M. VAIDYA, Speeding-up linear programming using fast matrix multiplication, in Proc. of the 30th Annual Symp. on Foundations of Computer Science, Los Alamitos, CA, IEEE Computer Soc. Press, 1990, pp. 332-337.
29. J. P. VIAL, Decomposition of structured linear programs based on analytic centers, in Lecture Notes in Economics and Mathematical Systems 353, Springer-Verlag, Berlin, 1991, pp. 190-203.
30. M. H. WRIGHT, Interior methods for constrained optimization, in Acta Numerica 1992, A. Iserles, ed., Cambridge University Press, New York, NY, 1992, pp. 341-407.
31. 3L) potential reduction algorithm for linear programming, Math. Programming, 50 (1991), pp. 239-258.
32. Y. YE AND E. TSE, An extension of Karmarkar's projective algorithm for convex quadratic programming, Math. Programming, 44 (1989), pp. 157-179.