Sparse convex relaxations in polynomial optimization

MaRDI QIDQ6524827arXivFDO

Authors Gennadiy Averkov, Benjamin Peters, Sebastian Sager

Published in arXiv

Mathematics Subject Classification ID

Real algebra (13J30) Semidefinite programming (90C22) Polynomial optimization (90C23) Nonconvex programming, global optimization (90C26)

This page was built for publication: Sparse convex relaxations in polynomial optimization

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