A method of bi-coordinate variations with tolerances and its convergence

We propose a method of bi-coordinate variations for optimal resource allocation problems, which involve simplex type constraints. It consists in making coordinate-wise steps together with special threshold control and tolerances whose values reduce sequentially. The method is simpler essentially than the usual gradient ones, which enables one to apply it to large dimensional optimization problems. We establish its convergence and rate of convergence under rather mild assumptions.