A cutting-plane method with internal iteration points for the general convex programming problem
A cutting method for solving the problem of convex programming was proposed. The method calculates iteration points based on approximation by polyhedral sets of the constraint region and the epigraph of the objective function. Its distinguishing feature is that the main sequence of approximations is...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kazan Federal University
2024-01-01
|
| Series: | Учёные записки Казанского университета: Серия Физико-математические науки |
| Subjects: | |
| Online Access: | https://uzakufismat.elpub.ru/jour/article/view/11 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|