The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs

DOI10.1007/978-3-319-32859-1_48zbMATH Open1460.90116OpenAlexW2467358359MaRDI QIDQ2807876FDOQ2807876

Authors: Bhagyesh V. Patil 

Publication date: 25 May 2016

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_48

Recommendations

• The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems
• Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
• An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
• Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Analysis of algorithms (68W40) Mixed integer programming (90C11)

Cited In (6)

• Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
• Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
• An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
• An efficient algorithm for range computation of polynomials using the Bernstein form
• The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry

This page was built for publication: The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807876)