On the program implementation of a Markov homogeneous monotonous random search algorithm of an extremum

摘要

A program that implements a Markov homogeneous monotonous random search algorithm of an extremum is presented. This program allows to solve a fairly wide class of problems of finding the global extremum of an objective function with a high accuracy.