Rescaling Algorithms for Linear Programming - Part I: Conic feasibility

  title={Rescaling Algorithms for Linear Programming - Part I: Conic feasibility},
  author={Daniel Dadush and L{\'a}szl{\'o} A. V{\'e}gh and Giacomo Zambelli},
We propose simple polynomial-time algorithms for two linear conic feasibility problems. For a matrix A ∈ Rm×n, 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. Both algorithms iterate between simple first order steps and rescaling steps. These rescalings steps improve natural geometric potentials in the domain and image spaces, respectively. If Goffin’s condition measure ρ̂A is negative, then the kernel problem… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 5 times. VIEW TWEETS


Publications referenced by this paper.
Showing 1-10 of 37 references

On scaled projections and pseudoinverses

G. W. Stewart
Linear Algebra and its Applications, • 1989
View 5 Excerpts
Highly Influenced

A deterministic rescaled perceptron algorithm

Math. Program. • 2016
View 15 Excerpts
Highly Influenced

A polynomial projection algorithm for linear feasibility problems

Math. Program. • 2015
View 12 Excerpts
Highly Influenced

Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem

Discrete & Computational Geometry • 2004
View 10 Excerpts
Highly Influenced

Condition numbers for polyhedra with real number data

Oper. Res. Lett. • 1995
View 4 Excerpts
Highly Influenced

An ε-precise feasible solution to a linear program with a convexity constraint in 1/ε2 iterations independent of problem size

G. B. Dantzig
Technical report, • 1992
View 6 Excerpts
Highly Influenced

Smooth minimization of non-smooth functions

Math. Program. • 2005
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…