Scholarlink

<p>In this paper, we propose a deterministic approach for finding the first zero-crossing point of a differentiable, possibly multiextremal univariate function, that combines a Branch-and-Bound framework with piece-wise linear under- and overestimators derived from Lipschitz intervals. Two algorithms are presented: a baseline algorithm and a version enhanced with interval reduction techniques. Theoretical guarantees of correctness and finite termination of the introduced methods are established. Extensive numerical experiments on 27 benchmark problems demonstrate that the proposed methods outperform the existing interval Branch-and-Bound approach both in terms of running time and accuracy.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Two deterministic algorithms for finding the first zero-crossing point of a multiextremal function

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年3月6日

查看全文
  • Mikhail Posypkin,
  • Yaroslav Sergeyev,
  • Zhongqi Wu

摘要

In this paper, we propose a deterministic approach for finding the first zero-crossing point of a differentiable, possibly multiextremal univariate function, that combines a Branch-and-Bound framework with piece-wise linear under- and overestimators derived from Lipschitz intervals. Two algorithms are presented: a baseline algorithm and a version enhanced with interval reduction techniques. Theoretical guarantees of correctness and finite termination of the introduced methods are established. Extensive numerical experiments on 27 benchmark problems demonstrate that the proposed methods outperform the existing interval Branch-and-Bound approach both in terms of running time and accuracy.