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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kazan Federal University
2024-01-01
|
| Series: | Учёные записки Казанского университета. Серия Физико-математические науки |
| Subjects: | |
| Online Access: | https://uzakufismat.elpub.ru/jour/article/view/22 |