Semidefinite approximations for quadratic programs over orthogonal matrices

DOI10.1007/s10898-009-9499-7zbMath1203.90121OpenAlexW2057575932MaRDI QIDQ609564

Janez Povh

Publication date: 1 December 2010

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

Full work available at URL: https://doi.org/10.1007/s10898-009-9499-7

zbMATH Keywords

quadratic programmingsemidefinite programmingcopositive programmingeigenvalue boundquadratic assignment problemgraph partitioning problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (2)

BiqBin: Moving Boundaries for NP-hard Problems by HPC ⋮ Contribution of copositive formulations to the graph partitioning problem

Uses Software

• QAPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• QAPLIB-A quadratic assignment problem library
• Copositive and semidefinite relaxations of the quadratic assignment problem
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• Bounds for the quadratic assignment problem using the bundle method
• Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
• A computational study of graph partitioning
• Semidefinite programming relaxations for the quadratic assignment problem
• Recent advances in the solution of quadratic assignment problems
• Graph partitioning using linear and semidefinite programming
• A projection technique for partitioning the nodes of a graph
• Semidefinite programming relaxations for the graph partitioning problem
• Approximation algorithms for minimum \(K\)-cut
• On the copositive representation of binary and continuous nonconvex quadratic programs
• The variation of the spectrum of a normal matrix
• On Lagrangian Relaxation of Quadratic Matrix Constraints
• Approximation of the Stability Number of a Graph via Copositive Programming
• Recent directions in netlist partitioning: a survey
• A spectral approach to bandwidth and separator problems in graphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Quadratic Matrix Programming
• A Copositive Programming Approach to Graph Partitioning
• Solving Lift-and-Project Relaxations of Binary Integer Programs
• Lower Bounds for the Partitioning of Graphs
• On copositive programming and standard quadratic optimization problems

This page was built for publication: Semidefinite approximations for quadratic programs over orthogonal matrices