Parallelization of the quantile function optimization algorithms

Consideration was given to optimization of the loss function that is individually convex in the strategy and random vector. The problem was solved using the confidential method which majorizes the estimate of the quantile function. Two methods to determine the desired estimate were discussed. Both allow one to parallelize calculation of the estimate and reduce the problem to the solution of a set of convex programming problems.