A Continuous d-Step Conjecture for Polytopes
暂无分享,去创建一个
[1] Tamás Terlaky,et al. Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes , 2009 .
[2] Josef Stoer,et al. On the complexity of following the central path of linear programs by linear extrapolation II , 1991, Math. Program..
[3] K. Brown,et al. Graduate Texts in Mathematics , 1982 .
[4] Michael Shub,et al. On the Curvature of the Central Path of Linear Programming Theory , 2003, Found. Comput. Math..
[5] G. C. Shephard,et al. Convex Polytopes , 1969, The Mathematical Gazette.
[6] G. Ziegler. Lectures on Polytopes , 1994 .
[7] J. D. Tardós,et al. Publish or Perish , 1987 .
[8] Victor Klee,et al. Many Polytopes Meeting the Conjectured Hirsch Bound , 1998, Discret. Comput. Geom..
[9] G. Kalai,et al. A quasi-polynomial bound for the diameter of graphs of polyhedra , 1992, math/9204233.
[10] Tamás Terlaky,et al. Polytopes and arrangements: Diameter and curvature , 2008, Oper. Res. Lett..
[11] M. Spivak. A comprehensive introduction to differential geometry , 1979 .
[12] Kerstin Fritzsche,et al. More polytopes meeting the conjectured Hirsch bound , 1999, Discret. Math..
[13] James Renegar,et al. A mathematical view of interior-point methods in convex optimization , 2001, MPS-SIAM series on optimization.
[14] V. Klee,et al. Thed-step conjecture for polyhedra of dimensiond<6 , 1967 .
[15] R. Freund. Review of A mathematical view of interior-point methods in convex optimization, by James Renegar, SIAM, Philadelphia, PA , 2004 .
[16] Nesa L'abbe Wu,et al. Linear programming and extensions , 1981 .
[17] C. Roos,et al. Interior Point Methods for Linear Optimization , 2005 .