Rescaling Algorithms for Linear Conic Feasibility
Rescaling Algorithms for Linear Conic Feasibility
We propose simple polynomial-time algorithms for two linear conic feasibility problems. For a matrix [Formula: see text], the kernel problem requires a positive vector in the kernel of A, and the image problem requires a positive vector in the image of A T . Both algorithms iterate between simple first-order …