Lower bound functions for polynomials

DOI10.1016/S0377-0427(03)00422-9zbMath1032.65055MaRDI QIDQ1405189

Christian Jansson, Jürgen Garloff, Andrew Paul Smith

Publication date: 25 August 2003

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergencenonlinear systemsnumerical examplespolynomialserror boundglobal optimisationBernstein expansionrelaxation techniqueslower bound functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)

Related Items

Global optimization with spline constraints: a new branch-and-bound method based on B-splines, Polytope-based computation of polynomial ranges, The Bernstein polynomial basis: a centennial retrospective, Rigorous filtering using linear relaxations, New quadratic lower bound for multivariate functions in global optimization, Computing the pessimism of inclusion functions, Matrix methods for the tensorial Bernstein form, Safe and tight linear estimators for global optimization, Constraint aggregation for rigorous global optimization, 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

Uses Software

• lp_solve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inclusion isotonicity of convex-concave extensions for polynomials based on Bernstein expansion
• Optimal computation of the Bernstein algorithm for the bound of an interval polynomial
• A collection of test problems for constrained global optimization algorithms
• Error estimates for approximations from control nets
• Bounds for an interval polynomial
• Handbook of global optimization
• Convergence of the (GOP) algorithm for a large class of smooth optimization problems
• Rigorous convex underestimators for general twice-differentiable problems
• A combined method for enclosing all solutions of nonlinear systems of polynomial equations
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• Die Berechnung von Schranken für den Wertebereich eines Polynoms in einem Intervall
• Jointly Constrained Biconvex Programming
• Box-bisection for solving second-degree systems and the problem of clustering
• Interval Methods for Systems of Equations
• Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
• Rigorous Lower and Upper Bounds in Linear Programming
• Bernstein form of a polynomial
• On factorization of analytic functions and its verification
• Introduction to global optimization.
• Quasiconvex relaxations based on interval arithmetic
• Optimized refinable enclosures of multivariate polynomial pieces