2004
DOI: 10.1007/s00454-004-2878-4
View full text
|
|
Share

Abstract: AbstractWe consider the homogenized linear feasibility problem, to find an x on the unit sphere, satisfying n linear inequalities a T i x ≥ 0. To solve this problem we consider the centers of the insphere of spherical simplices, whose facets are determined by a subset of the constraints. As a result we find a new combinatorial algorithm for the linear feasibility problem. If we allow rescaling this algorithm becomes polynomial. We point out that the algorithm solves as well the more general convex feasibility…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
19
0

Publication Types

Select...

Relationship

0
0

Authors

Journals