The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems

DOI10.1007/978-3-319-31769-4_15MaRDI QIDQ2803598zbMATH OpenOpenAlexFDO

Authors Bhagyesh V. Patil, P. S. V. Nataraj

Publication date 2 May 2016

Published in Scientific Computing, Computer Arithmetic, and Validated Numerics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-319-31769-4_15

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Recommendations

• The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
• 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

Cited in

(4)

• 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
• The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry

This page was built for publication: The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems

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