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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of global optimization Ročník 49; číslo 2; s. 185 - 212
Hlavní autori:	Nataraj, P. S. V., Arounassalame, M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.02.2011 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!