New positive semidefinite relaxations for nonconvex quadratic programs

MaRDI QIDQ2768052zbMATH OpenFDO

Authors Jean B. Lasserre

Publication date 10 October 2002

zbMATH Keywords

global optimizationsemidefinite programmingmoment problem

Mathematics Subject Classification ID

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

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

Cited in

(10)

• New semidefinite relaxations for a class of complex quadratic programming problems
• Partial Lagrangian relaxation for general quadratic programming
• An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
• Towards breaking the exponential barrier for general secret sharing
• New semidefinite programming relaxations for box constrained quadratic program
• A note on set-semidefinite relaxations of nonconvex quadratic programs
• Nonconvex quadratic programming, semidefinite relaxations and randomization algorithms in information and decision systems
• Semidefinite programming relaxation for nonconvex quadratic programs
• New results on semidefinite bounds forℓ₁-constrained nonconvex quadratic optimization
• A new semidefinite programming relaxation scheme for a class of quadratic matrix problems

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)