Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
From MaRDI portal
(Redirected from Publication:625645)
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
- scientific article; zbMATH DE number 1595639 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 804609 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- A collection of test problems for constrained global optimization algorithms
- Algorithm 852
- An approximate approach of global optimization for polynomial programming problems
- An efficient and safe framework for solving optimization problems
- An improved interval global optimization algorithm using higher-order inclusion function forms
- Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
- GloptiPoly
- Handbook of global optimization
- On the combination of interval constraint solvers
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- Rigorous global search: continuous problems
- Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
Cited in
(17)- The Bernstein polynomial basis: a centennial retrospective
- The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs
- Computing the range of values of real functions using B-spline form
- Constrained global optimization of multivariate polynomials using polynomial B-spline form and B-spline consistency prune approach
- Matrix methods for the tensorial Bernstein form
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- The Bernstein branch-and-bound unconstrained global optimization algorithm for MINLP problems
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems
- A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form
- Bounds for the range of a complex polynomial over a rectangular region
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
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)
