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

We present a novel efficient theoretical and numerical framework for solving global non-convex polynomial optimization problems. We analytically demonstrate that such problems can be efficiently reformulated using a non-linear objective over a convex set; further, these reformulated problems possess...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Letourneau, Pierre-David, Jones, Dalton, Morse, Matthew, Langston, M. Harper
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Mathematical Software Computer Science - Numerical Analysis Mathematics - Numerical Analysis Mathematics - Optimization and Control
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!