Approximating non-convex quadratic programs by semidefinite and copositive programming

MaRDI QIDQ3656591zbMATH OpenFDO

Authors Janez Povh, Franz Rendl

Publication date 13 January 2010

zbMATH Keywords

eigenvalue boundgraph partitioning problemquadratic assignment problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22) Programming involving graphs or networks (90C35)

Recommendations

• Semidefinite approximations for quadratic programs over orthogonal matrices
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• Copositive and semidefinite relaxations of the quadratic assignment problem
• On the set-semidefinite representation of nonconvex quadratic programs with cone constraints

Cited in

(16)

• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization
• On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
• On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
• scientific article; zbMATH DE number 554533 (Why is no real title available?)
• An LPCC approach to nonconvex quadratic programs
• scientific article; zbMATH DE number 708837 (Why is no real title available?)
• Representing quadratically constrained quadratic programs as generalized copositive programs
• Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
• Complex Matrix Decomposition and Quadratic Programming
• Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
• Semidefinite approximations for quadratic programs over orthogonal matrices
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
• Copositive and semidefinite relaxations of the quadratic assignment problem
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs

Describes a project that uses

Uses Software

• QAPLIB

This page was built for publication: Approximating non-convex quadratic programs by semidefinite and copositive programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3656591)