Open AccessSEARCH FOR AN EXTREMUM USING THE STEEPEST DESCENT METHOD UNDER THE CONDITIONS OF EXPERIMENTAL ERRORS
Author(s) -
a Otkhozoria,
Vano Otkhozoria,
Shorena Khorava
Publication year - 2022
Publication title -
world science/world science
Language(s) - English
Resource type - Journals
eISSN - 2414-6404
pISSN - 2413-1032
DOI - 10.31435/rsglobal_ws/28022022/7785
Subject(s) - gradient descent , method of steepest descent , meaning (existential) , realization (probability) , descent (aeronautics) , computer science , algorithm , function (biology) , mathematics , process (computing) , mathematical optimization , artificial intelligence , statistics , engineering , psychology , artificial neural network , evolutionary biology , psychotherapist , biology , aerospace engineering , operating system
One of the spread first level methods of optimum search is learned by the steepest descent method in conditions when there are mistakes in the experiment. The steepest descent method is investigated and is successfully applied in situations, when, there are no mistakes of experiment. However, in real situations the used means of measurement always have determined errors owing to what the appropriate meanings of the response receives with mistakes. The model of the steepest descent algorithm in created, when the length of the step does not depend on the meaning of the purpose functioning. Stepping process realization algorithm and program provision in MathCAD, computer mathematic, system is designed. The realization outcome mistakes for different meaning are presented, the step movement of the optimum dot direction is shown according to function meaning and argument meaning as well. The amount needed for the tactics necessary to approach the minimum is established, the quake amplitude in the surrounding of different level experiment mistakes at the optimum search efficiency in different step conditions.