New positive semidefinite relaxations for nonconvex quadratic programs
From MaRDI portal
Publication:2768052
zbMATH Open1015.90063MaRDI QIDQ2768052FDOQ2768052
Authors: Jean B. Lasserre 
Publication date: 10 October 2002
Recommendations
- scientific article; zbMATH DE number 1380758
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Semidefinite programming relaxation for nonconvex quadratic programs
- A note on set-semidefinite relaxations of nonconvex quadratic programs
- Copositive realxation for genera quadratic programming
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)
Cited In (10)
- Partial Lagrangian relaxation for general quadratic programming
- New results on semidefinite bounds forℓ1-constrained nonconvex quadratic optimization
- Towards breaking the exponential barrier for general secret sharing
- New semidefinite relaxations for a class of complex quadratic programming problems
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- A note on set-semidefinite relaxations of nonconvex quadratic programs
- Semidefinite programming relaxation for nonconvex quadratic programs
- New semidefinite programming relaxations for box constrained quadratic program
- Nonconvex quadratic programming, semidefinite relaxations and randomization algorithms in information and decision systems
This page was built for publication: New positive semidefinite relaxations for nonconvex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768052)
