Fixing Variables in Semidefinite Relaxations

From MaRDI portal
Publication:4943670

DOI10.1137/S089547989631442XzbMath0961.90075MaRDI QIDQ4943670

Christoph Helmberg

Publication date: 19 March 2000

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)




Related Items

Mathematical Programming Models and Exact AlgorithmsGlobally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-boundSolving Max-cut to optimality by intersecting semidefinite and polyhedral relaxationsA Derivation of Lovász' Theta via Augmented Lagrange DualityLP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparisonSemidefinite relaxations of ordering problemsA New Global Optimization Scheme for Quadratic Programs with Low-Rank NonconvexityOn Integrality in Semidefinite Programming for Discrete OptimizationA guide to conic optimisation and its applicationsUnifying semidefinite and set-copositive relaxations of binary problems and randomization techniquesA framework for solving mixed-integer semidefinite programsThe equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scalingMaximum-entropy sampling and the Boolean quadric polytopeSimple solution methods for separable mixed linear and quadratic knapsack problemA semidefinite programming heuristic for quadratic programming problems with complementarity constraintsNew semidefinite programming relaxations for the linear ordering and the traveling salesman problemSemidefinite relaxations for partitioning, assignment and ordering problemsSemidefinite Programming and Constraint ProgrammingSemidefinite relaxations for partitioning, assignment and ordering problemsOn parametric semidefinite programmingSemidefinite programming