Convexification of box-constrained polynomial optimization problems via monomial patterns

From MaRDI portal

Convexification of box-constrained polynomial optimization problems via monomial patterns (scientific article from arXiv)

Jump to:navigation, search

MaRDI QIDQ7126927arXivFDO

Authors Gennadiy Averkov, Benjamin Peters, Sebastian Sager

Publication date 2019

Published in arXiv

arXiv classification

This page was built for publication: Convexification of box-constrained polynomial optimization problems via monomial patterns

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Convexification_of_box-constrained_polynomial_optimization_problems_via_monomial_patterns_(scientific_article_from_arXiv)&oldid=106905998"