Pages that link to "Item:Q1405189"
From MaRDI portal
The following pages link to Lower bound functions for polynomials (Q1405189):
Displaying 12 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Polytope-based computation of polynomial ranges (Q426184) (← links)
- The Bernstein polynomial basis: a centennial retrospective (Q448993) (← links)
- Rigorous filtering using linear relaxations (Q453629) (← links)
- Fast construction of constant bound functions for sparse polynomials (Q1029674) (← links)
- An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369) (← links)
- Enhancing numerical constraint propagation using multiple inclusion representations (Q1039582) (← links)
- Safe and tight linear estimators for global optimization (Q1774166) (← links)
- Matrix methods for the tensorial Bernstein form (Q2008413) (← links)
- New quadratic lower bound for multivariate functions in global optimization (Q2228598) (← links)
- Computing the pessimism of inclusion functions (Q2481139) (← links)
- Constraint aggregation for rigorous global optimization (Q5962722) (← links)
