Pages that link to "Item:Q2476985"
From MaRDI portal
The following pages link to How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds (Q2476985):
Displayed 12 items.
- Polytope-based computation of polynomial ranges (Q426184) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- On the volumetric path (Q691484) (← 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)
- The central path visits all the vertices of the Klee–Minty cube (Q3423600) (← links)
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- A linear constrained optimization Benchmark for probabilistic search algorithms: the rotated Klee-Minty problem (Q6073024) (← links)
- The Chebyshev center as an alternative to the analytic center in the feasibility pump (Q6081593) (← links)
- Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)