Quadratic factorization heuristics for copositive programming

DOI10.1007/S12532-011-0022-ZzbMath1219.90134OpenAlexW1985534144MaRDI QIDQ542052

Franz Rendl, Florian Jarre, Immanuel M. Bomze

Publication date: 8 June 2011

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-011-0022-z

zbMATH Keywords

combinatorial optimizationclique numbercopositive programs

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (7)

Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ On the computational complexity of membership problems for the completely positive cone and its dual ⋮ Contribution of copositive formulations to the graph partitioning problem ⋮ Completely positive reformulations for polynomial optimization

Uses Software

• DIMACS
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Copositive and semidefinite relaxations of the quadratic assignment problem
• Copositive programming motivated bounds on the stability and the chromatic numbers
• The sandwich theorem
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
• A note on Burer's copositive representation of mixed-binary QPs
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Algorithmic copositivity detection by simplicial partition
• Approximation of the Stability Number of a Graph via Copositive Programming
• Gap, cosum and product properties of the θ′ bound on the clique number
• An improved characterisation of the interior of the completely positive cone
• Constructing copositive matrices from interior matrices
• A comparison of the Delsarte and Lovász bounds
• On the Shannon capacity of a graph
• An Adaptive Linear Approximation Algorithm for Copositive Programs
• On copositive programming and standard quadratic optimization problems

This page was built for publication: Quadratic factorization heuristics for copositive programming