Pages that link to "Item:Q5704143"
From MaRDI portal
The following pages link to Unifying Condition Numbers for Linear Programming (Q5704143):
Displaying 17 items.
- A condition-based algorithm for solving polyhedral feasibility problems (Q457560) (← links)
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization (Q463718) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Stability under perturbations of some condition numbers in optimization (Q959959) (← links)
- On strata of degenerate polyhedral cones. II: Relations between condition measures (Q964924) (← links)
- On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization (Q1005132) (← links)
- On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
- Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- Ill-posedness with respect to the solvability in linear optimization (Q2496624) (← links)
- Condition Number Theorems in Linear-Quadratic Optimization (Q3114598) (← links)
- (Q4822033) (← links)
- Computation of condition numbers for linear programming problems using Peña’s method (Q5475283) (← links)
- Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity (Q5758204) (← links)
- Computational performance of a projection and rescaling algorithm (Q5865326) (← links)
- A new condition number for linear programming (Q5955567) (← links)
- Linear programming sensitivity measured by the optimal value worst-case analysis (Q6644997) (← links)
