A note on set-semidefinite relaxations of nonconvex quadratic programs
From MaRDI portal
(Redirected from Publication:386483)
Recommendations
- New positive semidefinite relaxations for nonconvex quadratic programs
- Copositive realxation for genera quadratic programming
- scientific article; zbMATH DE number 1380758
- Semidefinite programming relaxation for nonconvex quadratic programs
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
Cites work
- scientific article; zbMATH DE number 5493304 (Why is no real title available?)
- A Copositive Programming Approach to Graph Partitioning
- A note on Burer's copositive representation of mixed-binary QPs
- Approximation of the stability number of a graph via copositive programming
- Block pivoting and shortcut strategies for detecting copositivity
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Copositive realxation for genera quadratic programming
- Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- On copositive programming and standard quadratic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
Cited in
(7)- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- scientific article; zbMATH DE number 1664574 (Why is no real title available?)
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- New positive semidefinite relaxations for nonconvex quadratic programs
- On the Slater condition for the SDP relaxations of nonconvex sets
- Semidefinite programming relaxation for nonconvex quadratic programs
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
This page was built for publication: A note on set-semidefinite relaxations of nonconvex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386483)