Pages that link to "Item:Q4385160"
From MaRDI portal
The following pages link to On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data (Q4385160):
Displaying 7 items.
- Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
- On the complexity of solving feasible systems of linear inequalities specified with approximate data (Q1919805) (← links)
- On the block-structured distance to non-surjectivity of sublinear mappings (Q2487844) (← links)
- Extreme points of well-posed polytopes (Q3446581) (← links)
- (Q4369264) (← links)
- The radius of metric regularity (Q4779878) (← links)
- Approximation Bounds for Sparse Programs (Q5073726) (← links)