Pages that link to "Item:Q1037369"
From MaRDI portal
The following pages link to An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369):
Displaying 12 items.
- 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)
- On stability of parametrized families of polynomials and matrices (Q610875) (← links)
- Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← 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)
- A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (Q2294575) (← links)
- Formalization of Bernstein polynomials and applications to global optimization (Q2351165) (← links)
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form (Q2363599) (← links)
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
- A connected component labeling algorithm for implicitly defined domains (Q6161317) (← links)
