Solving LP problems via weighted centers

SIAM Journal on Optimization

Volumn 6, Issue 4, 1996, Pages 933-960

  Liao, Aiping ^a   Todd, Michael J ^b  

^a Cornell University ^*  (United States)

^b School of Operations Research and Industrial Engineering   (United States)

Author keywords

Linear programming; Newton's method; The ellipsoid method; Weighted center

Indexed keywords

EID: 0030507068     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623493254273     Document Type: Article

References (30)

1. D. AVIS AND V. CHVATAL, Notes on Bland's pivoting rule, Math. Programming Study, 8 (1978), pp. 24-34.
2. R. G. BLAND, D. GOLDFARB, AND M. J. TODD, The ellipsoid method: A survey, Oper. Res., 29 (1981), pp. 1039-1091.
3. B. P. BURRELL AND M. J. TODD, The ellipsoid method generates dual variables, Math. Oper. Res., 10 (1985), pp. 688-700.
4. V. CHVÁTAL, Linear Programming, W. H. Freeman and Company, San Francisco, CA, 1980.
5. J. L. GOFFIN, On the non-polynomiality of the relaxation method for systems of linear inequalities, Math. Programming, 22 (1982), pp. 93-103.
6. D. GOLDFARB AND M. J. TODD, Modifications and implementation of the ellipsoid algorithm for linear programming, Math. Programming, 23 (1982), pp. 1-19.
7. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, 1990.
8. F. JOHN, Extremum problems with inequalities as subsidiary conditions, in Studies and Essays (Courant Anniversary Volume), Interscience, New York, 1948.
9. N. K. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
10. L. G. KHACHIYAN, A polynomial algorithm for linear programming, Dokl. Akad. Nauk USSR, 244 (1979), pp. 1093-1096.
11. L. G. KHACHIYAN AND M. J. TODD, On the complexity of approximating the maximal inscribed ellipsoid for a polytope, Math. Programming, 61 (1993), pp. 137-159.
12. A. Y. LEVIN, On an algorithm for the minimization of convex functions, Soviet Math. Dokl., 6 (1965), pp. 286-290.
13. A. LIAO, Algorithms for Linear Programming via Weighted Centers, Ph.D. thesis, Cornell University, Ithaca, NY, 1992.
14. A. LIAO AND M. J. TODD, The ellipsoid algorithm using parallel cuts, Comput. Optim. Appl., 2 (1993), pp. 299-316.
15. _, Solving LP Problems via Weighted Centers, CCOP Report 93-10, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1993.
16. C. B. MOLER, J. LITTLE, S. BANGERT, AND S. KLEIMAN, Pro-Matlab User's Guide, The Math-Works, Inc., 1987.
17. J. L. NAZARETH, Pricing criteria in linear programming, in Progress in Mathematical Programming, N. Meggiddo, ed., Springer-Verlag, New York, 1989, pp. 105-130.
18. D. J. NEWMAN, Location of the maximum on unimodal surfaces, J. Assoc. Comput. Mach., 12 (1965), pp. 395-398.
19. J. RENEGAR, A polynomial-time algorithm based on Newton's method for linear programming, Math. Programming, 40 (1988), pp. 59-93.
20. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
21. N. Z. SHOR, Utilization of the operation of space dilatation in the minimization of convex functions, Cybernetics, 6 (1970), pp. 7-15.
22. _, Cut-off method with space extension in convex programming problems, Cybernetics, 13 (1977), pp. 94-96.
23. G. SONNEVEND, An analytical center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in Lecture Notes in Control and Information Sciences, No. 84, Springer-Verlag, Berlin, 1986, pp. 866-875.
24. S. P. TARASOV, L. G. KHACHIYAN, AND I. I. ERLICH, The method of inscribed ellipsoids, Sov. Math. Dokl., 37 (1988), pp. 226-230.
25. M. J. TODD, Some Remarks on the Relaxation Method for Linear Inequalities, Technical Report 419, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1979.
26. _, On minimum volume ellipsoids containing part of a given ellipsoid, Math. Oper. Res., 7 (1980), pp. 253-261.
27. _, Improved bounds and containing ellipsoids in Karmarkar's linear programming algorithm, Math. Oper. Res., 13 (1988), pp. 650-659.
28. P. M. VAIDYA, A new algorithm for minimizing convex functions over convex sets, Math. Programming, 73 (1996), pp. 291-341.
29. Y. YE, Karmarkar's algorithm and the ellipsoid method, Oper. Res. Lett., 6 (1987), pp. 177-182.
30. D. B. YUDIN AND A. S. NEMIROVSKII, Informational complexity and efficient, methods for the solution of convex extremal problems, Matekon, 13 (1976), pp. 3-25.