Pages that link to "Item:Q1029674"
From MaRDI portal
The following pages link to Fast construction of constant bound functions for sparse polynomials (Q1029674):
Displaying 14 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- Polytope-based computation of polynomial ranges (Q426184) (← 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)
- Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems (Q832032) (← links)
- TMsim: an algorithmic tool for the parametric and worst-case simulation of systems with uncertainties (Q1993019) (← links)
- Matrix methods for the tensorial Bernstein form (Q2008413) (← links)
- Comparison of two polynomial approaches in performance analysis for periodic piecewise polynomial systems (Q2027429) (← links)
- Edge detection by adaptive splitting. II: The three-dimensional case (Q2276408) (← 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)
- A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
