Fast construction of constant bound functions for sparse polynomials
From MaRDI portal
Recommendations
- Sparse Polynomial Approximation of High-Dimensional Functions
- On some computations on sparse polynomials
- Learning Theory
- Sparse polynomial approximation in finite fields
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
- scientific article; zbMATH DE number 1263400
- Faster sparse multivariate polynomial interpolation of straight-line programs
- On the evaluation of some sparse polynomials
- Sparse generalised polynomials
Cites work
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 2068058 (Why is no real title available?)
- A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials
- Algorithms for polynomials in Bernstein form
- Arbitrarily high degree elevation of Bézier representations
- Bernstein form of a polynomial
- Bézier and B-spline techniques
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Inclusion isotonicity of convex-concave extensions for polynomials based on Bernstein expansion
- Lower bound functions for polynomials
- Rigorous convex underestimators for general twice-differentiable problems
- Rigorous global search: continuous problems
- Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
- Safe and tight linear estimators for global optimization
- Safe bounds in linear and mixed-integer linear programming
Cited in
(17)- Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Matrix methods for the tensorial Bernstein form
- Edge detection by adaptive splitting. II: The three-dimensional case
- Polytope-based computation of polynomial ranges
- Optimizations for tensorial Bernstein-Based solvers by using polyhedral bounds
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Comparison of two polynomial approaches in performance analysis for periodic piecewise polynomial systems
- On stability of parametrized families of polynomials and matrices
- Solving Linear Systems with Polynomial Parameter Dependency with Application to the Verified Solution of Problems in Structural Mechanics
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- BERN-NN: Tight Bound Propagation For Neural Networks Using Bernstein Polynomial Interval Arithmetic
- A subdivision algorithm to reason on high-degree polynomial constraints over finite domains
- Formalization of Bernstein polynomials and applications to global optimization
- The Bernstein polynomial basis: a centennial retrospective
- A review of computation of mathematically rigorous bounds on optima of linear programs
- TMsim: an algorithmic tool for the parametric and worst-case simulation of systems with uncertainties
This page was built for publication: Fast construction of constant bound functions for sparse polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029674)
