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

Institutions

Publication Details

Published
2026-11-17
DOI
https://doi.org/10.24108/preprints-3117066
Primary Topic
Advanced Optimization Algorithms Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Accelerated bisection search for minimizing unimodal functions

Vladimir Kodnyanko
1 links
Advanced Optimization Algorithms Research
preprint

Accelerated bisection search for minimizing unimodal functions

Vladimir Kodnyanko
preprint en

Abstract

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.

Siberian Federal University (RU)
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon