Abstract. A general scheme for non-smooth convex optimization based on the separating plane algorithm with additional clippings is considered. The convergence of the algorithm is proved. The results of numerical experiments are given, which demonstrated the overall computational efficiency compared to known leaders in this field. Of especial interest are the computational results applied to projection version of the transportation problems with flow constraints.

Keywords: convex optimization, separating plane method, cutting plane method.