A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs

DOI10.1007/978-3-319-45587-7_10zbMath1432.90100arXiv1603.02566OpenAlexW3105236435MaRDI QIDQ2835666

Maribel Montenegro, Christoph Buchheim, Angelika Wiegele

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.02566

zbMATH Keywords

semidefinite programmingcoordinate descent methodnon-convex quadratic integer optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Integer programming (90C10) Quadratic programming (90C20)

Related Items (1)

A branch-and-bound algorithm for solving max-\(k\)-cut problem

Uses Software

• Unnamed Item

Cites Work

• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Quadratic programming with one negative eigenvalue is NP-hard
• Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
• The polynomial solvability of convex quadratic programming
• On the Shannon capacity of a graph
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• CSDP, A C library for semidefinite programming

This page was built for publication: A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs