An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial

DOI10.1007/978-3-540-87477-5_20zbMath1160.90698MaRDI QIDQ3627691

Hoai An Le Thi, Ahmed Zidna, Mohand Ouanes

Publication date: 13 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_20

zbMATH Keywords

global optimization; root-finding; quadratic lower function; quadratic upper function

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Uses Software

• MultRoot

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of isolating real roots and computing with certainty the topological degree
• Algorithms for polynomials in Bernstein form
• Unconstrained and constrained global optimization of polynomial functions in one variable
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
• A practical guide to splines
• Global one-dimensional optimization using smooth auxiliary functions
• A nonsmooth global optimization technique using slopes: The one-dimensional case
• Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
• On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
• Global minimization of univariate functions by sequential polynomial approximation
• Solving a Polynomial Equation: Some History and Recent Progress
• Computing multiple roots of inexact polynomials
• On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration