A cutting-plane method with internal iteration points for the general convex programming problem

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...

Full description

Bibliographic Details
Main Authors: I. Ya. Zabotin, K. E. Kazaeva, O. N. Shulgina
Format: Article
Language:English
Published: Kazan Federal University 2024-01-01
Series:Учёные записки Казанского университета. Серия Физико-математические науки
Subjects:
convex programming
conditional minimization
optimal value
set approximation
function epigraph
iteration point
sequence of approximations
cutting hyperplane
convergence
Online Access:https://uzakufismat.elpub.ru/jour/article/view/11

Internet

https://uzakufismat.elpub.ru/jour/article/view/11

Similar Items