Pages that link to "Item:Q4441959"
From MaRDI portal
The following pages link to Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization (Q4441959):
Displaying 17 items.
- 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)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems (Q853555) (← links)
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems (Q868472) (← links)
- On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
- The condition number of a function relative to a set (Q2039239) (← links)
- On the block-structured distance to non-surjectivity of sublinear mappings (Q2487844) (← links)
- Computational experience with rigorous error bounds for the Netlib linear programming library (Q2503174) (← links)
- Sign consistent linear programming problems (Q3648620) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- A Data-Independent Distance to Infeasibility for Linear Conic Systems (Q4959838) (← links)
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit (Q4983284) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules (Q5413871) (← links)
- Computation of condition numbers for linear programming problems using Peña’s method (Q5475283) (← links)
