Stochastic algorithm for minimization of an additive function

A stochastic recurrent algorithm of finding the minimum of an additive function is studied in which the ordinal number of the function whose antigradient determines the direction in a specific iteration is chosen randomly. The algorithm characteristics are shown to be related with a set of Pareto-optimal solutions of a multi-criterial minimization problem.