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.00347OpenAlexW2288470313MaRDI QIDQ5364279
Amélie Lambert, Alain Billionnet, Angelika Wiegele, Sourour Elloumi
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 programmingquadratic 0-1 programmingbundle methoddensest subgraphsubgradient algorithmLagrangian dualityconvex reformulation\(k\)-cluster
Related Items
\texttt{EXPEDIS}: an exact penalty method over discrete sets ⋮ Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem ⋮ Using general triangle inequalities within quadratic convex reformulation method ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Mixing convex-optimization bounds for maximum-entropy sampling ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation ⋮ MIQCR-CB ⋮ Spectral bounds for graph partitioning with prescribed partition sizes ⋮ On solving the densestk-subgraph problem on large graphs
Uses Software
