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

Full description

Bibliographic Details

Published in:	Journal of global optimization Vol. 49; no. 2; pp. 185 - 212
Main Authors:	Nataraj, P. S. V., Arounassalame, M.
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.02.2011 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!