Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems

In this paper it is considered the modified simplex imbeddings method, which is related to the class of cutting plane methods. The main feature of this method is the convergence estimation, which depends only on the quantity of simplex vertices, that are cut off by the cutting plane. The more vertices are cut off by the cutting plane, the higher speed of method convergence. Modified method of simplex imbeddings with such criteria of cutting plane choosing is applied to solving special class of convex non-differentiable problems, which is consists of two types of functions. We come across the necessity to describe the function subdifferential that is depends on one or several parameters, that we can subject to optimization. It is described functions subdifferentials from the introduced class in parametric representation, that let us form auxiliary problems in simplex imbeddings method for searching resulting cutting planes, that cut off as much vertices of simplex as possible. It let us increase the speed of finding optimal solution. The results of numerical experiment are also given in this paper.