Central AsianResearch Index

STABLE ITERATIVE METHODS IN PROBLEM OF CONSTRAINED CONVEX MINIMIZATIONS

We investigate the ill-posed problem of minimizing a convex functional in a Hilbert space. Previously, in the author’s work, the problem of minimizing a quadratic functional was considered. The iterative processes that are stable to disturbances of all input data were constructed and studied. In this paper the developed approach is generalized to the constrained convex minimization. The proposed methods generate regularizing algorithms for quadratic and convex minimization problems, in contrast to direct methods that do not have this property

Сведения

Опубликовано
2024 · Т. 12, № 4, С. 150-157
Язык
Английский
ISSN
2306-6172 · 2308-9822
Издатель
L. N. Gumilyov Eurasian National University