Polytopes and arrangements: Diameter and curvature

Operations Research Letters

Volumn 36, Issue 2, 2008, Pages 215-222

  Deza, Antoine ^a   Terlaky, Tamás ^a   Zinchenko, Yuriy ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Arrangements; Central path; Diameter; Polytopes; Total curvature

Indexed keywords

ANALOG COMPUTERS; CURVE FITTING; NUMERICAL METHODS;

CURVATURES; DIAMETER; POLYTOPES;

OPERATIONS RESEARCH;

EID: 39149117422     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2007.06.007     Document Type: Article

References (16)

1. Barnette D. An upper bound for the diameter of a polytope. Discrete Math. 10 (1974) 9-13
2. Borgwardt K.H. The Simplex Method-A Probabilistic Analysis (1987), Springer, Berlin
3. Dantzig G. Linear Programming and Extensions (1963), Princeton University Press, Princeton, NJ
4. Dedieu J.-P., Malajovich G., and Shub M. On the curvature of the central path of linear programming theory. Found. Comput. Math. 5 (2005) 145-171
5. Dedieu J.-P., and Shub M. Newton flow and interior point methods in linear programming. International J. Bifurcation Chaos 15 (2005) 827-839
6. A. Deza, T. Terlaky, Y. Zinchenko, Central path curvature and iteration-complexity for redundant Klee-Minty cubes, In: D. Gao, H. Sherali (Eds.), Advances in Mechanics and Mathematics III, 2007, pp. 215-248.
7. A. Deza, F. Xie, Hyperplane arrangements with large average diameter, AdvOL-Report 2007/5, McMaster University, 2007.
8. Fritzsche K., and Holt F. More polytopes meeting the conjectured Hirsch bound. Discrete Math. 205 (1999) 77-84
9. Grünbaum B. Convex Polytopes, Graduate Texts in Mathematics vol. 221 (2003), Springer, Berlin
10. Holt F., and Klee V. Many polytopes meeting the conjectured Hirsch bound. Discrete Comput. Geometry 20 (1998) 1-17
11. Kalai G., and Kleitman D. A quasi-polynomial bound for the diameter of graphs of polyhedra. Bull. Am. Math. Soc. 26 (1992) 315-316
12. Klee V., and Walkup D. The d-step conjecture for polyhedra of dimension d < 6. Acta Math. 133 (1967) 53-78
13. Renegar J. A Mathematical View of Interior-Point Methods in Convex Optimization (2001), SIAM, Philadelphia, PA
14. Roos C., Terlaky T., and Vial J.-Ph. Interior Point Methods for Linear Optimization (2006), Springer, Berlin
15. Spivak M. Comprehensive Introduction to Differential Geometry (1990), Publish or Perish, Berkeley, CA
16. Ziegler G. Lectures on Polytopes, Graduate Texts in Mathematics vol. 152 (1995), Springer, Berlin