scientific article; zbMATH DE number 1985306

MaRDI QIDQ4429170zbMATH OpenFDO

Authors Jean B. Lasserre

Publication date 24 September 2003

zbMATH Keywords

convex relaxationslinear programmingnon-convex programmingsemidefinite programming

Mathematics Subject Classification ID

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

Recommendations

• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• Polynomial Programming: LP-Relaxations Also Converge
• Semidefinite programming relaxations for linear semi-infinite polynomial programming
• Semidefinite programming relaxations for semialgebraic problems
• New SDP relaxations for unconstrained 0-1 polynomial programming problems

Cited in

(9)

• On linear programming relaxations for solving polynomial programming problems
• Affine reductions for LPs and SDPs
• Alternative SDP and SOCP approximations for polynomial optimization
• A Lagrangian relaxation view of linear and semidefinite hierarchies
• New SDP relaxations for unconstrained 0-1 polynomial programming problems
• SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
• Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
• Polynomial Programming: LP-Relaxations Also Converge
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming

This page was built for publication:

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