Pages that link to "Item:Q2505641"
From MaRDI portal
The following pages link to On the curvature of the central path of linear programming theory (Q2505641):
Displaying 14 items.
- An analogue of the Klee-Walkup result for sonnevend's curvature of the central path (Q289062) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384507) (← links)
- The central curve in linear programming (Q695626) (← links)
- Polytopes and arrangements: diameter and curvature (Q935228) (← links)
- A continuous \(d\)-step conjecture for polytopes (Q1017920) (← links)
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial (Q4564017) (← links)
- The degree of the central curve in semidefinite, linear, and quadratic programming (Q5030928) (← links)
- What Tropical Geometry Tells Us about the Complexity of Linear Programming (Q5150211) (← links)
- Diameter and Curvature: Intriguing Analogies (Q5301011) (← links)
- On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate (Q5864697) (← links)
- Two simple proofs for analyticity of the central path in linear programming. (Q5937499) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
- On the complexity of analyticity in semi-definite optimization (Q6118356) (← links)
