New SDP relaxations for unconstrained 0-1 polynomial programming problems

MaRDI QIDQ3109419zbMATH OpenFDO

Authors Shuhui Ji

Publication date 27 January 2012

zbMATH Keywords

0-1 unconstrained polynomial optimizationlinear relaxationmatrix decompositionsemidefinite relaxation

Mathematics Subject Classification ID

Numerical methods of relaxation type (49M20) Semidefinite programming (90C22)

Recommendations

• scientific article; zbMATH DE number 1985306
• scientific article; zbMATH DE number 1757962
• Semidefinite programming relaxation for nonconvex quadratic programs
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming

Cited in

(4)

• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
• An iterative scheme for valid polynomial inequality generation in binary polynomial programming
• scientific article; zbMATH DE number 1985306 (Why is no real title available?)
• scientific article; zbMATH DE number 1757962 (Why is no real title available?)

This page was built for publication: New SDP relaxations for unconstrained 0-1 polynomial programming problems

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