Some issues in the theory of optimal algorithms and informational complexity (Q1395088)

The article presents the basic concepts and reviews the main results of the theory of optimal algorithms and informational complexity. Informational complexity bounds are provided for Lipschitzian multi-criterion problems that construct the approximate Pareto-optimal strategy set under different interpretations of approximation-approximation ``by the functional'' and approximation ``by the argument.'' The informational complexity is compared for the scalar global optimization problem and the problem of finding the roots of nonlinear equations by global search methods.