The following pages link to (Q4851610):
Displayed 22 items.
- Computing the range of values of real functions using B-spline form (Q272547) (← links)
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Bounds on the number of steps of WDS required for checking the positivity of integral forms (Q555413) (← links)
- On stability of parametrized families of polynomials and matrices (Q610875) (← links)
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645) (← links)
- On the complexity of isolating real roots and computing with certainty the topological degree (Q700184) (← links)
- Solving interval constraints by linearization in computer-aided design (Q868685) (← links)
- On nonsingularity of a polytope of matrices (Q935386) (← links)
- An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369) (← links)
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420) (← links)
- Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
- TMsim: an algorithmic tool for the parametric and worst-case simulation of systems with uncertainties (Q1993019) (← links)
- An integrative approach for analysis of nonlinear electrical circuits using-polynomial B-spline expansion and B-spline Krawczyk operator (Q2114513) (← links)
- High-order quadrature on multi-component domains implicitly defined by multivariate polynomials (Q2134493) (← 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)
- Guaranteed parameter set estimation for exponential sums: the three-terms case (Q2641462) (← links)
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems (Q5059211) (← links)
- Stability and distance to instability for polynomial matrix families. Complex perturbations (Q5073028) (← links)
- Quasiconvex relaxations based on interval arithmetic (Q5929744) (← links)
- A connected component labeling algorithm for implicitly defined domains (Q6161317) (← links)