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

DOI10.2298/YJOR120620004LzbMATH Open1458.65052OpenAlexW2293110063MaRDI QIDQ2975426FDOQ2975426

Authors: Le Thi Hoai An, Mohand Ouanes, A. 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

Recommendations

• An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial
• scientific article; zbMATH DE number 440790
• scientific article; zbMATH DE number 3846864
• ALGORITHMS USING A BRANCH AND BOUND METHOD FOR FINDING ALL REAL SOLUTIONS TO AN EQUATION OF ONE VARIABLE
• An algorithm for locating all zeros of a real polynomial

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (3)

• ALGORITHMS USING A BRANCH AND BOUND METHOD FOR FINDING ALL REAL SOLUTIONS TO AN EQUATION OF ONE VARIABLE
• Piecewise quadratic bounding functions for finding real roots of polynomials
• An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2975426)