Pages that link to "Item:Q2784423"
From MaRDI portal
The following pages link to A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine (Q2784423):
Displaying 15 items.
- Round-off estimates for second-order conic feasibility problems (Q447897) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Robust smoothed analysis of a condition number for linear programming (Q662310) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- Probabilistic analysis of condition numbers for linear programming (Q700762) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- Coverage processes on spheres and condition numbers for linear programming (Q964778) (← links)
- On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
- Conditioning of random conic systems under a general family of input distributions (Q1029212) (← links)
- On the complexity of the Plantinga-Vegter algorithm (Q2172649) (← links)
- Probabilistic analysis of the Grassmann condition number (Q2340501) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- Extreme points of well-posed polytopes (Q3446581) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
