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

DOI10.2298/YJOR120620004LzbMath1458.65052OpenAlexW2293110063MaRDI 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)

Full work available at URL: https://doi.org/10.2298/yjor120620004l

zbMATH Keywords

global optimizationroot-findingbound and reduce branchbound w-subdivisionquadratic lower functionquadratic upper function

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Quadratic programming (90C20) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)

Related Items (1)

Piecewise quadratic bounding functions for finding real roots of polynomials

This page was built for publication: Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms