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

Full work available at URL https://doi.org/10.1007/978-3-031-73365-9_4

zbMATH Keywords

approximating setconstrained minimizationconvergenceconvex programmingcutting planee-solutionepigraph of a functioniteration point

Mathematics Subject Classification ID

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

Cites work

• A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems
• A minimization method with approximation of feasible set and epigraph of objective function
• Development of optimization methods in the investigations of V. P. Bulatov
• scientific article; zbMATH DE number 3841621 (Why is no real title available?)
• scientific article; zbMATH DE number 53965 (Why is no real title available?)
• scientific article; zbMATH DE number 3892037 (Why is no real title available?)
• On several algorithms of immersion - cutoff for the problem of mathematical programming

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)