Pages that link to "Item:Q3423600"
From MaRDI portal
The following pages link to The central path visits all the vertices of the Klee–Minty cube (Q3423600):
Displaying 6 items.
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
- A simpler and tighter redundant Klee-Minty construction (Q941030) (← links)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds (Q2476985) (← links)
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
- Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)
