Pages that link to "Item:Q4895608"
From MaRDI portal
The following pages link to Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs (Q4895608):
Displaying 11 items.
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
- Some perturbation theory for linear programming (Q1334953) (← links)
- On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
- Connections between the total least squares and the correction of an infeasible system of linear inequalities (Q1765915) (← links)
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems (Q1777217) (← links)
- On the complexity of solving feasible systems of linear inequalities specified with approximate data (Q1919805) (← links)
- Probabilistic analysis of the Grassmann condition number (Q2340501) (← links)
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
- On the block-structured distance to non-surjectivity of sublinear mappings (Q2487844) (← links)
