Fast construction of constant bound functions for sparse polynomials
From MaRDI portal
Publication:1029674
DOI10.1007/s10898-007-9195-4zbMath1168.90011OpenAlexW2131845859MaRDI QIDQ1029674
Publication date: 13 July 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9195-4
Bernstein polynomialsrelaxationinterval arithmeticmultivariate polynomialslazy evaluationconstrained global optimizationbound functions
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, A review of computation of mathematically rigorous bounds on optima of linear programs, On stability of parametrized families of polynomials and matrices, Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach, Polytope-based computation of polynomial ranges, BERN-NN: Tight Bound Propagation For Neural Networks Using Bernstein Polynomial Interval Arithmetic, The Bernstein polynomial basis: a centennial retrospective, An improved Bernstein global optimization algorithm for MINLP problems with application in process industry, TMsim: an algorithmic tool for the parametric and worst-case simulation of systems with uncertainties, Matrix methods for the tensorial Bernstein form, Edge detection by adaptive splitting. II: The three-dimensional case, Comparison of two polynomial approaches in performance analysis for periodic piecewise polynomial systems, A subdivision algorithm to reason on high-degree polynomial constraints over finite domains, Solving Linear Systems with Polynomial Parameter Dependency with Application to the Verified Solution of Problems in Structural Mechanics, Formalization of Bernstein polynomials and applications to global optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Inclusion isotonicity of convex-concave extensions for polynomials based on Bernstein expansion
- Algorithms for polynomials in Bernstein form
- Arbitrarily high degree elevation of Bézier representations
- Rigorous global search: continuous problems
- Lower bound functions for polynomials
- Safe bounds in linear and mixed-integer linear programming
- Bézier and B-spline techniques
- Safe and tight linear estimators for global optimization
- Rigorous convex underestimators for general twice-differentiable problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
- A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials
- Bernstein form of a polynomial
