RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestn. YuUrGU. Ser. Vych. Matem. Inform.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestn. YuUrGU. Ser. Vych. Matem. Inform., 2018, Volume 7, Issue 4, Pages 59–66 (Mi vyurv199)  

Computational Mathematics

Binary scan search (biscan) for conditional minimization of weakly uniomodal functions

V. A. Kodnyanko

Siberian Federal University (Kirensky str., 26A, Krasnoyarsk 660074, Russia)

Abstract: A method of binary scan search (biscan) is proposed for conditional minimization of weakly unimodal functions. The application area of this method is the optimization of piecewise, stepwise, relay and other weakly unimodal functions, the extremum of which can be localized, both in narrow and extended regions, including the regions of constancy of the minimized function. The algorithm implementing the method is represented by two procedures, the block diagrams of which are given in the article. To evaluate the performance of the biscan, a comparative computational experiment was carried out using examples of minimizing a number of weakly unimodal functions. It is established that, in comparison with competing methods, the biscan gives better performance. The fastest method is provided by minimizing non-constant monotonic functions. To determine the extremum, only five calculations of such a function are required. In comparison with the golden section search, the biscain has a 1.5 times greater speed in solving problems of this type. In minimizing strictly weakly unimodal functions, to which the known methods of minimizing unimodal functions are not applicable, in particular, the golden section search, the biscan operates orders of magnitude faster than the competing sequential search method.

Keywords: binary scanning, biscan, golden section search, direct search method, unimodal function, weakly unimodal function, minimization of function, method speed.

DOI: https://doi.org/10.14529/cmse180404

Full text: PDF file (454 kB)
References: PDF file   HTML file

UDC: 519.67
Received: 03.05.2018

Citation: V. A. Kodnyanko, “Binary scan search (biscan) for conditional minimization of weakly uniomodal functions”, Vestn. YuUrGU. Ser. Vych. Matem. Inform., 7:4 (2018), 59–66

Citation in format AMSBIB
\Bibitem{Kod18}
\by V.~A.~Kodnyanko
\paper Binary scan search (biscan) for conditional minimization of weakly uniomodal functions
\jour Vestn. YuUrGU. Ser. Vych. Matem. Inform.
\yr 2018
\vol 7
\issue 4
\pages 59--66
\mathnet{http://mi.mathnet.ru/vyurv199}
\crossref{https://doi.org/10.14529/cmse180404}
\elib{https://elibrary.ru/item.asp?id=36528035}


Linking options:
  • http://mi.mathnet.ru/eng/vyurv199
  • http://mi.mathnet.ru/eng/vyurv/v7/i4/p59

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Vestnik Yuzhno-Ural'skogo Gosudarstvennogo Universiteta. Seriya "Vychislitelnaya Matematika i Informatika"
    Number of views:
    This page:58
    Full text:13
    References:7

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021