activity
20092026
most citedLog-barrier interior point methods are not strongly polynomial

66 citations · 468 across the 34 of their papers we have counts for

collaborators
Showing 2013Show all

5 papers · 1 filter

math.CO2013★ 17 cited

Combinatorial simplex algorithms can solve mean payoff games

Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert +1

A combinatorial simplex algorithm is an instance of the simplex method in which the pivoting depends on combinatorial data only. We show that any algorithm of this kind admits a tr…

math.CO2013★ 16 cited

Tropical Fourier-Motzkin elimination, with an application to real-time verification

Xavier Allamigeon, Uli Fahrenberg, Stéphane Gaubert +2

We introduce a generalization of tropical polyhedra able to express both strict and non-strict inequalities. Such inequalities are handled by means of a semiring of germs (encoding…

math.CO2013★ 56 cited

Tropicalizing the simplex algorithm

Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert +1

We develop a tropical analog of the simplex algorithm for linear programming. In particular, we obtain a combinatorial algorithm to perform one tropical pivoting step, including th…

math.OC2013

Certification of inequalities involving transcendental functions: combining SDP and max-plus approximation

Xavier Allamigeon, Stéphane Gaubert, Victor Magron +1

We consider the problem of certifying an inequality of the form , , where is a multivariate transcendental function, and is a compact semialgebr…

cs.SC2013★ 7 cited

Certification of Bounds of Non-linear Functions: the Templates Method

Xavier Allamigeon, Stéphane Gaubert, Victor Magron +1

The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by semialgebraic or transcendental expressions. The certificate must be, eventually,…