Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
From MaRDI portal
Publication:625645
DOI10.1007/S10898-009-9485-0zbMATH Open1209.90294OpenAlexW1989986988MaRDI QIDQ625645FDOQ625645
Authors: M. Arounassalame, P. S. V. Nataraj 
Publication date: 25 February 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9485-0
Recommendations
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs
- The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems
- Constrained global optimization of multivariate polynomials using polynomial B-spline form and B-spline consistency prune approach
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
Cites Work
- Rigorous global search: continuous problems
- Algorithm 852
- Title not available (Why is that?)
- Title not available (Why is that?)
- GloptiPoly
- A collection of test problems for constrained global optimization algorithms
- Handbook of global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- An approximate approach of global optimization for polynomial programming problems
- An efficient and safe framework for solving optimization problems
- Title not available (Why is that?)
- Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
- Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- On the combination of interval constraint solvers
- An improved interval global optimization algorithm using higher-order inclusion function forms
Cited In (17)
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Computing the range of values of real functions using B-spline form
- Matrix methods for the tensorial Bernstein form
- Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems
- A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form
- The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Bounds for the range of a complex polynomial over a rectangular region
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- The Bernstein polynomial basis: a centennial retrospective
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems
- Constrained global optimization of multivariate polynomials using polynomial B-spline form and B-spline consistency prune approach
Uses Software
This page was built for publication: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625645)
