Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
From MaRDI portal
Publication:4441959
DOI10.1137/S1052623402401804zbMath1046.90001OpenAlexW1566432244MaRDI QIDQ4441959
Robert M. Freund, Fernando Ordóñez
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623402401804
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (17)
A stable primal-dual approach for linear programming under nondegeneracy assumptions ⋮ On verified numerical computations in convex programming ⋮ On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems ⋮ Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems ⋮ Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization ⋮ Improving a primal–dual simplex-type algorithm using interior point methods ⋮ Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules ⋮ On the block-structured distance to non-surjectivity of sublinear mappings ⋮ Computational experience with rigorous error bounds for the Netlib linear programming library ⋮ The condition number of a function relative to a set ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems ⋮ A hybrid branch-and-bound approach for exact rational mixed-integer programming ⋮ Computation of condition numbers for linear programming problems using Peña’s method ⋮ On strata of degenerate polyhedral cones. I: Condition and distance to strata ⋮ A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit ⋮ Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work ⋮ Sign consistent linear programming problems
Uses Software
This page was built for publication: Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
