5 citations · 7 across the 2 of their papers we have counts for
3 papers
Improving ADMMs for Solving Doubly Nonnegative Programs through Dual Factorization
Martina Cerulli, Marianna De Santis, Elisabeth Gaar +1
Alternating direction methods of multipliers (ADMMs) are popular approaches to handle large scale semidefinite programs that gained attention during the past decade. In this paper,…
SDP-based branch-and-bound for non-convex quadratic integer optimization
Christoph Buchheim, Maribel Montenegro, Angelika Wiegele
Semidefinite programming (SDP) relaxations have been intensively used for solving discrete quadratic optimization problems, in particular in the binary case. For the general non-co…
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
Elisabeth Gaar, Daniel Krenn, Susan Margulies +1
Vizing's conjecture (open since 1968) relates the sizes of dominating sets in two graphs to the size of a dominating set in their Cartesian product graph. In this paper, we formula…