Pages that link to "Item:Q625645"

The following pages link to Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645):

Displaying 7 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)
• 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)
• Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials (Q1740149) (← links)