output
20052022
most citedThe Uncertainty Principle in the Presence of Quantum Memory

850 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing math.OCShow all

5 papers · 1 filter

math.OC2014

On low complexity Acceleration Techniques for Randomized Optimization: Supplementary Online Material

Sebastian U. Stich

Recently it was shown by Nesterov (2011) that techniques form convex optimization can be used to successfully accelerate simple derivative-free randomized optimization methods. The…

math.OC2012★ 2 cited

Variable Metric Random Pursuit

Sebastian U. Stich, Christian L. Müller, Bernd Gärtner

We consider unconstrained randomized optimization of smooth convex objective functions in the gradient-free setting. We analyze Random Pursuit (RP) algorithms with fixed (F-RP) and…

math.OC2011

A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem

Bernd Gärtner, Markus Sprecher

We give a polynomial-time dynamic programming algorithm for solving the linear complementarity problem with tridiagonal or, more generally, Hessenberg P-matrices. We briefly review…

math.OC2009★ 5 cited

Combinatorial Characterizations of K-matrices

Jan Foniok, Komei Fukuda, Lorenz Klaus

We present a number of combinatorial characterizations of K-matrices. This extends a theorem of Fiedler and Ptak on linear-algebraic characterizations of K-matrices to the setting…

math.OC2008★ 7 cited

Pivoting in Linear Complementarity: Two Polynomial-Time Cases

Jan Foniok, Komei Fukuda, Bernd Gärtner +1

We study the behavior of simple principal pivoting methods for the P-matrix linear complementarity problem (P-LCP). We solve an open problem of Morris by showing that Murty's least…