Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
From MaRDI portal
Publication:5364279
DOI10.1287/ijoc.2016.0731zbMath1371.90098arXiv1603.00347MaRDI QIDQ5364279
Alain Billionnet, Sourour Elloumi, Amélie Lambert, Angelika Wiegele
Publication date: 4 October 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.00347
semidefinite programming; quadratic 0-1 programming; bundle method; densest subgraph; subgradient algorithm; Lagrangian duality; convex reformulation; \(k\)-cluster
Related Items
Uses Software