AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions))

DOI10.15807/jorsj.54.161zbMath1254.90157OpenAlexW1566177854MaRDI QIDQ3144757

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

semidefinite programmingpolynomial optimizationsemidefinite programming relaxationfacial reduction algorithm

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items (1)

Facial reduction algorithms for conic optimization problems

Uses Software

• CSDP
• SDPT3
• SparsePOP
• Benchmarks for Optimization Software

This page was built for publication: AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions))