Unifying Condition Numbers for Linear Programming

DOI10.1287/moor.28.4.609.20520zbMath1082.90061OpenAlexW2100793163WikidataQ57733254 ScholiaQ57733254MaRDI QIDQ5704143

Felipe Cucker, Dennis Cheung, Javier F. Peña

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/72804b12144bc1d0bd9e0e9d22b74b0a55c36153

zbMATH Keywords

complementarity problemsCondition numbersdistance ill-posedness

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (12)

A condition-based algorithm for solving polyhedral feasibility problems ⋮ Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization ⋮ Stability under perturbations of some condition numbers in optimization ⋮ On strata of degenerate polyhedral cones. II: Relations between condition measures ⋮ Solving linear programs with finite precision. II: Algorithms ⋮ Ill-posedness with respect to the solvability in linear optimization ⋮ Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity ⋮ On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization ⋮ A hybrid branch-and-bound approach for exact rational mixed-integer programming ⋮ On strata of degenerate polyhedral cones. I: Condition and distance to strata ⋮ Condition Number Theorems in Linear-Quadratic Optimization ⋮ Computational performance of a projection and rescaling algorithm

Uses Software

• mctoolbox

This page was built for publication: Unifying Condition Numbers for Linear Programming