A cutting plane algorithm with an approximation of an epigraph

For the conditional minimization problem, we propose a cutting plane algorithm with an approximation of the epigraph of the objective function. The algorithm makes it possible to update approximating sets by dropping the cutting planes which accumulate during the solution process. We prove the convergence of the algorithm and describe its properties.