One approach to constructing cutting algorithms with dropping of cutting planes
From MaRDI portal
Publication:353915
DOI10.3103/S1066369X13030092zbMath1290.90075MaRDI QIDQ353915
Rashid Samatovich Yarullin, Igor' Yaroslavich Zabotin
Publication date: 16 July 2013
Published in: Russian Mathematics (Search for Journal in Brave)
algorithmconvergencecutting planeapproximating setconditional minimizationsequence of approximations
Convex programming (90C25) Nonlinear programming (90C30) Numerical methods for variational inequalities and related problems (65K15)
Related Items (4)
A minimization method with approximation of feasible set and epigraph of objective function ⋮ Constrained integer fractional programming problem with box constraints ⋮ A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems ⋮ Constructing Mixed Algorithms on the Basis of Some Bundle Method
Cites Work
This page was built for publication: One approach to constructing cutting algorithms with dropping of cutting planes
