15 citations · 18 across the 3 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DM2019
Exact and approximation algorithms for the expanding search problem
Ben Hermans, Roel Leus, Jannik Matuschke
Suppose a target is hidden in one of the vertices of an edge-weighted graph according to a known probability distribution. The expanding search problem asks for a search sequence o…
math.OC2019★ 15 cited
QPALM: A Newton-type Proximal Augmented Lagrangian Method for Quadratic Programs
Ben Hermans, Andreas Themelis, Panagiotis Patrinos
We present a proximal augmented Lagrangian based solver for general convex quadratic programs (QPs), relying on semismooth Newton iterations with exact line search to solve the inn…