72 citations · 119 across the 18 of their papers we have counts for
5 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,…
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…
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…
Optimization of Convex Functions with Random Pursuit
Sebastian U. Stich, Christian L. Müller, Bernd Gärtner
We consider unconstrained randomized optimization of convex objective functions. We analyze the Random Pursuit algorithm, which iteratively computes an approximate solution to the…
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…