ARTICLE
TITLE

TWO ALGORITHMS FOR GLOBAL OPTIMIZATION OF ONE-VARIABLE FUNCTIONS BASED ON THE SMALLEST ESTIMATE DISTANCES BETWEEN EXTREMES AND THEIR NUMBER

SUMMARY

Contex. Making managerial decisions is often associated with solving one-dimensional global optimization problems. The most important property of global optimization methods is their speed, which is determined by the number of calls to the objective function in the optimization process.Objective. Development of high-performance algorithms global for optimizing the function of one variable, based on conditions that allow you to bring the problem to a form that opens up the practical possibility of obtaining a solution with a given accuracy.Method. Two algorithms of conditional global optimization of a function of one variable are considered. The first is based on estimating the smallest distance between neighboring local extrema and allows you to find the global minimum of the goal function and, if necessary, all its local extrema. The second is suitable for finding the global minimum of a function if the number of local extrema in the uncertainty interval is known in advance. Both algorithms are based on segmentation methods of the initial uncertainty segment. The local extremum on a segment is determined by three or four points. An approach is proposed that, in most cases, allows localization of the extremum at three points, which provides savings in the calculation of digital filters, thereby contributing to an increase in the speed of the algorithm.Results. The results of solving optimization problems and data on the effectiveness of the proposed algorithms are presented. A comparative analysis of the speed of the developed algorithms and well-known algorithms is carried out on the example of solving test problems used in world practice to assess the effectiveness of global optimization algorithms. Examples of the practical use of algorithms are given. The analysis of the data obtained showed that according to the number of calls to the objective function, the algorithms in the sequential computing mode work several times faster than modern high-speed algorithms with which they were compared.Conclusions. The data presented indicate the efficiency and high speed of the proposed algorithms. Their speed will be even higher if the stated ideas of algorithmization are extended to parallel computations. This suggests that the proposed algorithms can find practical application in the global optimization of functions of the considered classes of problems. 

 Articles related

Stavros Ioannis Valsamidis,Sotirios Kontogiannis,Alexandros Spiros Karakos    

The usage of web applications can be measured with the use of metrics. In a LMS, a typical web application, there are no appropriate metrics which would facilitate their qualitative and quantitative measurement. The purpose of this paper is to propose th... see more


sajani Pallegoda Vithana,Ruwanthi Abeysekara,Shane Oorloff,Vijitha Herath,Roshan Godaliyadda,Parakrama Ekanayake,Anuththara Rupasinghe    

This paper presents an analysis of hyperspectral image data carried out using two approaches followed with a comparison of the two. The hyperspectral image dataset used for analysis, corresponds to a strip along the North Eastern region of Sri Lanka, obt... see more


Moh Ainur Rohman, Sri Harini    

Dalam berita politik, banyak sekali informasi tokoh-tokoh politik dalam mendongkrak elektabilitasnya. Berbagai kontribusi mereka lakukan seperti bidang pendidikan, infrastruktur, UMKM, kesehatan, teknologi, dan pelayanan publik. Namun, untuk mengetahui b... see more


Muhammad Ibnu Choldun Rachmatullah    

One of the problems that are often faced by classifier algorithms is related to the problem of imbalanced data. One of the recommended improvement methods at the data level is to balance the number of data in different classes by enlarging the sample to ... see more


Victor Saputra Ginting    

Abstract – Technological developments in data security systems to ensure the confidentiality of data information has developed rapidly. To maintain the confidentiality of data information, there are sciences in development such as steganography and crypt... see more