Fixing Variables in Semidefinite Relaxations

DOI10.1137/S089547989631442XzbMATH Open0961.90075MaRDI QIDQ4943670FDOQ4943670

Authors: Christoph Helmberg 

Publication date: 19 March 2000

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

Recommendations

• Fixing variables in semidefinite relaxations
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• Semidefinite programming relaxations for the quadratic assignment problem
• Combining semidefinite and polyhedral relaxations for integer programs
• From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems

zbMATH Keywords

semidefinite programmingsemidefinite relaxationsquadratic 0-1 programmingreduced cost fixing

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31) Sensitivity, stability, well-posedness (49K40)

Cited In (24)

• A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
• Fixing variables in semidefinite relaxations
• A framework for solving mixed-integer semidefinite programs
• Mathematical programming models and exact algorithms
• Simple solution methods for separable mixed linear and quadratic knapsack problem
• Semidefinite relaxations for partitioning, assignment and ordering problems
• Semidefinite relaxations for partitioning, assignment and ordering problems
• Semidefinite programming
• A Derivation of Lovász' Theta via Augmented Lagrange Duality
• On different versions of the exact subgraph hierarchy for the stable set problem
• A guide to conic optimisation and its applications
• Title not available (Why is that?)
• Maximum-entropy sampling and the Boolean quadric polytope
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
• Semidefinite relaxations of ordering problems
• A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
• On parametric semidefinite programming
• Semidefinite programming and constraint programming
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
• The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling
• On Integrality in Semidefinite Programming for Discrete Optimization

This page was built for publication: Fixing Variables in Semidefinite Relaxations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943670)