An extension of the elimination method for a sparse SOS polynomial

DOI10.15807/JORSJ.54.161MaRDI QIDQ3144757zbMATH OpenOpenAlexFDO

Authors Hayato Waki, Masakazu Muramatsu

Publication date 8 December 2012

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.54.161

zbMATH Keywords

polynomial optimizationsemidefinite programmingsemidefinite programming relaxationfacial reduction algorithm

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
• Exploiting sparsity in SDP relaxation of polynomial optimization problems
• A facial reduction algorithm for finding sparse SOS representations
• SDP relaxations for quadratic optimization problems derived from polynomial optimization problems
• EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION

Cited in

(4)

• SDP relaxations for quadratic optimization problems derived from polynomial optimization problems
• Facial reduction algorithms for conic optimization problems
• A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
• Solving partial differential equations via sparse SDP relaxations

Describes a project that uses

Uses Software

• Benchmarks for Optimization Software
• SparsePOP
• SDPT3
• CSDP

This page was built for publication: An extension of the elimination method for a sparse SOS polynomial

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