A relaxed cutting method for the convex programming problem

DOI10.1007/978-3-031-73365-9_4MaRDI QIDQ6945729zbMATH OpenFDO

Authors Igor Yaroslavich Zabotin, Oksana Shulgina, Rashid Samatovich Yarullin

Publication date 8 August 2025

zbMATH Keywords

convergenceconvex programmingconstrained minimizationapproximating setcutting planeepigraph of a functioniteration pointe-solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

This page was built for publication: A relaxed cutting method for the convex programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945729)