An efficient algorithm for range computation of polynomials using the Bernstein form

We present a novel optimization algorithm for computing the ranges of multivariate polynomials using the Bernstein polynomial approach. The proposed algorithm incorporates four accelerating devices, namely the cut-off test, the simplified vertex test, the monotonicity test, and the concavity test, a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of global optimization 2009-11, Vol.45 (3), p.403-426
Hauptverfasser:	Ray, Shashwati, Nataraj, P. S. V.
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science Linear programming Mathematics Mathematics and Statistics Methods Operations Research/Decision Theory Optimization Optimization algorithms Optimization techniques Polynomials Power Real Functions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!