Accelerated bisection search for minimizing unimodal functions
This review describes an accelerated bisection method. The essence of accelerating classical bisection search is to eliminate redundant calculations of the unimodal function being minimized, thereby increasing the method's speed. The classical bisection is approximately 1.5 times slower than the golden section search. However, accelerated bisection is virtually as fast as the golden section and, in some cases, even exceeds it. For the selected functions and intervals, the overall efficiencies of accelerated bisection and the golden section were approximately the same.
Authors
- Vladimir Kodnyanko (ORCID: https://orcid.org/0000-0002-2369-045X)
Institutions
- Siberian Federal University (RU)
Publication Details
- Published
- 2026-11-17
- DOI
- https://doi.org/10.24108/preprints-3117066
- Primary Topic
- Advanced Optimization Algorithms Research
- Type
- preprint