Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions
DOI10.1137/S1064827599357590zbMath1014.65054OpenAlexW1979608743MaRDI QIDQ4785926
Leocadio G. Casado, Yaroslav D. Sergeyev, Inmaculada F. García
Publication date: 5 January 2003
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827599357590
algorithmsglobal optimizationnumerical experimentsinterval analysisbranch-and-boundnondifferentiable functionsminimal root
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items (11)
Uses Software
This page was built for publication: Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions