Selective bi-coordinate variations for resource allocation type problems

We suggest a modification of the coordinate descent methods for resource allocation problems, which keeps the basic convergence properties of the gradient ones, but enables one to reduce the total computational expenses and to provide all the computations in a distributed manner. We describe applications to economic (auction) equilibrium problems and give preliminary results of computational tests.