Pages that link to "Item:Q625645"
From MaRDI portal
The following pages link to Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645):
Displaying 14 items.
- Computing the range of values of real functions using B-spline form (Q272547) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- The Bernstein polynomial basis: a centennial retrospective (Q448993) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions (Q980524) (← links)
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420) (← links)
- Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials (Q1740149) (← links)
- Matrix methods for the tensorial Bernstein form (Q2008413) (← links)
- Bounds for the range of a complex polynomial over a rectangular region (Q2656078) (← links)
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems (Q5059211) (← links)
- A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form (Q5215368) (← links)
