Efficient methods for solving convex programming problems that apply embedding of admissible set in simplexes

A variant of the embedding method is proposed. In previous proposed variants the support cones played the role of embedding sets. Here the cones are replaced with support simplexes which enables one to obtain a polynomial guaranteed convergence rate and its best mean estimate. Tabl. 1, illustr. 2, bibl. 5.