Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem

DOI10.1007/s00454-004-2878-4zbMath1073.90028arXivmath/0206125MaRDI QIDQ705124

Ulrich. Betke

Publication date: 25 January 2005

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0206125

zbMATH Keywords

polynomial algorithm; combinatorial algorithm; Linear feasibility problem; spherical feasibility problem

Mathematics Subject Classification ID

90C25: Convex programming

52B55: Computational aspects related to convexity

90C27: Combinatorial optimization

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)