Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm

We propose an algorithm for constrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed Bernstein branch and prune algorithm is based on the Bernstein polynomial approach. We introduce several new features in this proposed algorithm to ma...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of global optimization Jg. 49; H. 2; S. 185 - 212
Hauptverfasser:	Nataraj, P. S. V., Arounassalame, M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.02.2011 Springer Nature B.V
Schlagworte:	Algorithms Computer Science Mathematical programming Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Propagation Real Functions Studies Pruning Constrained global optimization Subdivision Bernstein polynomials
ISSN:	0925-5001, 1573-2916
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!