Pages that link to "Item:Q2496177"
From MaRDI portal
The following pages link to Solving linear programs with finite precision. II: Algorithms (Q2496177):
Displaying 13 items.
- Round-off estimates for second-order conic feasibility problems (Q447897) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
- Solving second-order conic systems with variable precision (Q2340331) (← links)
- Flyspeck II: The basic linear programs (Q2379683) (← links)
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine (Q2784423) (← links)
- A New Finite Continuation Algorithm for Linear Programming (Q4895611) (← links)
- Probabilistic analyses of condition numbers (Q5740078) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
- Solving Linear Problems with Finite Precision III: Sharp Expectation Bounds (Q6225336) (← links)