An Efficient Framework for Global Non-Convex Polynomial Optimization over the Hypercube

MaRDI QIDQ6449353arXivFDO

Authors Pierre-David Letourneau, Dalton Jones, Matthew Morse, M. Harper Langston

Publication date 31 August 2023

Published in arXiv

arXiv classification

cs.MScs.NAmath.NAmath.OC

Cited in

(1)

• Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT

This page was built for publication: An Efficient Framework for Global Non-Convex Polynomial Optimization over the Hypercube

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