Piecewise quadratic bounding functions for finding real roots of polynomials

DOI10.3934/naco.2020015OpenAlexW3015942146MaRDI QIDQ2146436

Özen Özer, Djamel Aaid, Amel Noui

Publication date: 16 June 2022

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2020015

zbMATH Keywords

global optimizationbranch and boundroot-findingbranch and reducepiecewise quadratic lower functionpiecewise quadratic upper function

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Mathematical programming (90Cxx) Numerical analysis (65-XX)

Cites Work

• Rational cubic clipping with linear complexity for computing roots of polynomials
• A practical guide to splines
• Global optimization in one-dimensional case using analytically defined derivatives of objective function
• A rational cubic clipping method for computing real roots of a polynomial
• New quadratic lower bound for multivariate functions in global optimization
• Polynomials root-finding using a SLEFE-based clipping method
• Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms
• An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
• New technique for solving univariate global optimization

This page was built for publication: Piecewise quadratic bounding functions for finding real roots of polynomials