Answers are grounded in this paper and cite their sources.
We propose a method for solving a general convex programming problem, which belongs to the class of cutting methods. This method uses approximation both the problem's constraint region and the epigraph of its objective function by polyhedral sets to construct iteration points. We construct a sequence of iteration points according to the relaxation condition, and it is possible to estimate the proximity of the objective function's current values with its optimal value at each step of the method. The method is also characterized by the fact that it allows periodic updates of the approximating sets by discarding the cutting planes that form them. We prove the convergence of the method and discuss its implementations.
No takes yet. Share an insight, caveat, or question.
Zabotin et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: