72 citations · 119 across the 18 of their papers we have counts for
4 papers · 1 filter
Screening Rules for Convex Problems
Anant Raj, Jakob Olbrich, Bernd Gärtner +2
We propose a new framework for deriving screening rules for convex optimization problems. Our approach covers a large class of constrained and penalized optimization formulations,…
The Niceness of Unique Sink Orientations
Bernd Gärtner, Antonis Thomas
Random Edge is the most natural randomized pivot rule for the simplex algorithm. Considerable progress has been made recently towards fully understanding its behavior. Back in 2001…
ARRIVAL: A zero-player graph game in NP coNP
Jérôme Dohrau, Bernd Gärtner, Manuel Kohler +2
Suppose that a train is running along a railway network, starting from a designated origin, with the goal of reaching a designated destination. The network, however, is of a specia…
Formal Verification of Obstacle Avoidance and Navigation of Ground Robots
Stefan Mitsch, Khalil Ghorbal, David Vogelbacher +1
The safety of mobile robots in dynamic environments is predicated on making sure that they do not collide with obstacles. In support of such safety arguments, we analyze and formal…