NANAApr 29

In ratio section method and algorithms for minimizing unimodal functions

arXiv:2509.1597213.4h-index: 1
Predicted impact top 84% in NA · last 90 daysOriginality Incremental advance
AI Analysis

For researchers and practitioners needing fast optimization of unimodal functions, this method offers a significant speed improvement over existing techniques.

This paper introduces a ratio section method for minimizing unimodal functions that outperforms classical methods. The passive algorithm is 2.26 times faster than bisection and 1.72 times faster than golden section, while the active algorithm achieves 3.31 and 2.52 times speedup, respectively. The modernized Brent method is 1.69 times faster than its prototype.

This paper proposes a new method for section an interval in a given ratio intended for minimizing unimodal functions. The ratio section search is capable of quickly recognizing monotone functions and functions with a flat bottom, which contributes to increasing its performance, as measured by the number of minimized function evaluations. The method is implemented as passive and active algorithms. A comparison of the performance of the developed method with that of the classical methods of bisection search and the golden section search was performed on the basis of the data used to minimize twenty unimodal functions of various types. For all types of functions, the passive algorithm is 2.26 times faster than the bisection search and 1.72 times faster than the golden section method. Thus, the proposed method turned out to be the fastest of the known methods of cutting off segments intended for minimizing unimodal functions. The active algorithm is faster: for all types of functions, these indicators are 3.31 and 2.52, respectively. The fastest combined Brent method was also modernized. After the golden section procedure is replaced with a procedure for dividing a segment in a given ratio, a numerical experiment is conducted. The modernized method is 1.69 times faster than its prototype. Moreover, the performance of the active algorithm for dividing a segment at a given ratio exceeds that of the Brent method by 1.48 times for all types of functions. The modernized Brent method is approximately 4 times faster than the bisection search and 3 times faster than the golden section method.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes