K=1, if this task was solved succesfuly; K=0, if algorithm was failed (the algorithm did not improve Error value below 1e-2); R - rating according to score for this problem.
The important place in optimization process is taken by the choice of search starting point. It can effect significantly upon the optimization process itself, and, consequently, upon the effectiveness indices when carrying out the comparative analysis. As known, most of the algorithms require starting point. However, there is a number of algorithms (IOSO algorithms are among them), which do not require this value. During the starting stage of extremum search these algorithms use the following hypothesis: ”I know that I know nothing about the researched object”. In practice usually it is known some basic solution, which can be assumed as the starting point. However, we can sight a number of real-life problems, for which the starting point and any information about the object is unavailable.