Convergent SDP-Relaxations for Polynomial Optimization with Sparsity

DOI10.1007/11832225_27zbMATH Open1230.90152OpenAlexW1734843296MaRDI QIDQ5747823

Jean B. Lasserre

Publication date: 14 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11832225_27

Mathematics Subject Classification ID

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

Related Items (3)

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness ⋮ Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity ⋮ Algorithm 996

Uses Software

• GloptiPoly

This page was built for publication: Convergent SDP-Relaxations for Polynomial Optimization with Sparsity

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