Semidefinite Programming vs. LP Relaxations for Polynomial Programming

Jean B. LasserreMath. Oper. Res 2002 · DOI

BibTeX
@article{lasserre2002semidefinite,
  author = {Jean B. Lasserre},
  title = {{Semidefinite Programming vs. LP Relaxations for Polynomial Programming}},
  journal = {Math. Oper. Res.},
  year = {2002},
  doi = {10.1287/moor.27.2.347.322},
}

Loading related content...

Figure