An Efficient Framework for Global Non-Convex Polynomial Optimization with Algebraic Constraints

We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that possesses essentially no spurious local minima. Through nume...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Harris, Mitchell Tong, Letourneau, Pierre-David, Jones, Dalton, 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!