Lower bound functions for polynomials
From MaRDI portal
The authors investigate the relaxation techniques for solving nonlinear systems and global optimisation problems. They consider the lower bound functions in the case of problems involving multivariate polynomials. These functions are constructed by using Bernstein expansion. An error bound exhibiting quadratic convergence in the univariate case and some numerical examples are given.
Recommendations
- A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials
- scientific article; zbMATH DE number 2068058
- scientific article; zbMATH DE number 1984325
- Sequence of polyhedral relaxations for nonlinear univariate functions
- An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
Cites work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A collection of test problems for constrained global optimization algorithms
- A combined method for enclosing all solutions of nonlinear systems of polynomial equations
- Bernstein form of a polynomial
- Bounds for an interval polynomial
- Box-bisection for solving second-degree systems and the problem of clustering
- Convergence of the (GOP) algorithm for a large class of smooth optimization problems
- Die Berechnung von Schranken für den Wertebereich eines Polynoms in einem Intervall
- Error estimates for approximations from control nets
- Handbook of global optimization
- scientific article; zbMATH DE number 421451 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 3965308 (Why is no real title available?)
- scientific article; zbMATH DE number 4080778 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- Inclusion isotonicity of convex-concave extensions for polynomials based on Bernstein expansion
- Interval Methods for Systems of Equations
- Introduction to global optimization.
- Jointly Constrained Biconvex Programming
- On factorization of analytic functions and its verification
- Optimal computation of the Bernstein algorithm for the bound of an interval polynomial
- Optimized refinable enclosures of multivariate polynomial pieces
- Quasiconvex relaxations based on interval arithmetic
- Rigorous convex underestimators for general twice-differentiable problems
- Rigorous Lower and Upper Bounds in Linear Programming
- Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
Cited in
(17)- Fast construction of constant bound functions for sparse polynomials
- An efficient algorithm for range computation of polynomials using the Bernstein form
- Enhancing numerical constraint propagation using multiple inclusion representations
- Lower bounds for the polynomial calculus
- Safe and tight linear estimators for global optimization
- Matrix methods for the tensorial Bernstein form
- New quadratic lower bound for multivariate functions in global optimization
- Computing the pessimism of inclusion functions
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Polytope-based computation of polynomial ranges
- scientific article; zbMATH DE number 2068058 (Why is no real title available?)
- The Bernstein polynomial basis: a centennial retrospective
- Rigorous filtering using linear relaxations
- A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials
- Constraint aggregation for rigorous global optimization
- Lower bounds for a polynomial in terms of its coefficients
- Lower bounds for polynomials of many variables
This page was built for publication: Lower bound functions for polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405189)
