Semidefinite approximations for quadratic programs over orthogonal matrices
From MaRDI portal
Recommendations
- Approximating non-convex quadratic programs by semidefinite and copositive programming
- A low-dimensional semidefinite relaxation for the quadratic assignment problem
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Estimating bounds for quadratic assignment problems associated with Hamming and Manhattan distance matrices based on semidefinite programming
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1182569 (Why is no real title available?)
- A Copositive Programming Approach to Graph Partitioning
- A computational study of graph partitioning
- A projection technique for partitioning the nodes of a graph
- A spectral approach to bandwidth and separator problems in graphs
- Approximation algorithms for minimum \(K\)-cut
- Approximation of the stability number of a graph via copositive programming
- Bounds for the quadratic assignment problem using the bundle method
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Graph partitioning using linear and semidefinite programming
- Lower Bounds for the Partitioning of Graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On Lagrangian relaxation of quadratic matrix constraints
- On copositive programming and standard quadratic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- QAPLIB-A quadratic assignment problem library
- Quadratic Matrix Programming
- Recent advances in the solution of quadratic assignment problems
- Recent directions in netlist partitioning: a survey
- Semidefinite programming relaxations for the graph partitioning problem
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- The variation of the spectrum of a normal matrix
Cited in
(5)- BiqBin: moving boundaries for NP-hard problems by HPC
- Approximating non-convex quadratic programs by semidefinite and copositive programming
- Contribution of copositive formulations to the graph partitioning problem
- Some \(LP\) algorithms using orthogonal matrices
- Approximate Semidefinite Matrices in a Linear Variety
This page was built for publication: Semidefinite approximations for quadratic programs over orthogonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609564)
