A note on set-semidefinite relaxations of nonconvex quadratic programs

DOI10.1007/s10898-012-0013-2zbMath1277.90084OpenAlexW2055649011MaRDI QIDQ386483

Faizan Ahmed, Georg Still

Publication date: 9 December 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-012-0013-2

zbMATH Keywords

copositive- and set-positive relaxationsquadratic programssemidefinite-

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20) Boolean programming (90C09)

Cites Work

• Unnamed Item
• Representing quadratically constrained quadratic programs as generalized copositive programs
• Copositive and semidefinite relaxations of the quadratic assignment problem
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• A note on Burer's copositive representation of mixed-binary QPs
• Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Block pivoting and shortcut strategies for detecting copositivity
• Approximation of the Stability Number of a Graph via Copositive Programming
• Copositive realxation for genera quadratic programming
• Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
• Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints
• A Copositive Programming Approach to Graph Partitioning
• On copositive programming and standard quadratic optimization problems

This page was built for publication: A note on set-semidefinite relaxations of nonconvex quadratic programs