Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms

DOI10.2298/YJOR120620004LzbMath1458.65052MaRDI QIDQ2975426

Mohand Ouanes, Hoai An Le Thi, Ahmed Zidna

Publication date: 11 April 2017

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

global optimization; root-finding; bound and reduce branch; bound w-subdivision; quadratic lower function; quadratic upper function

Mathematics Subject Classification ID

90C25: Convex programming

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

90C30: Nonlinear programming

90C20: Quadratic programming

26C10: Real polynomials: location of zeros

65H04: Numerical computation of roots of polynomial equations