A Relaxed Version of the Cutting Method with Approximation of the Constraint Region

A cutting method was proposed for solving the convex programming problem. The method assumes that the constraint region of the problem is embedded into some polyhedral sets for constructing iteration points. It involves the construction of a sequence of approximations that belongs to the admissible...

Full description

Bibliographic Details

Published in:	Учёные записки Казанского университета: Серия Физико-математические науки
Main Authors:	I. Ya. Zabotin, O. N. Shulgina, R. S. Yarullin
Format:	Article
Language:	English
Published:	Kazan Federal University 2024-01-01
Subjects:	convex programming sequence of approximation relaxation convergence approximation generalized support vector subdifferential cutting plane
Online Access:	https://uzakufismat.elpub.ru/jour/article/view/22