Iterative approximation for convex optimization problems with operator constraints in a Hilbert space (Q5954737)

This paper is devoted to the problem of finding the minimum and a minimizer of an integral functional in a Hilbert space under operator constraints. For this problem, a method of iterative approximation is proposed that reduces the problem to a sequence of finite-dimensional problems with an infinite number of constraints; for the latter type of problems, a regularized constraint aggregation method is developed. Based on this method algorithms are constructed that solve the original infinite-dimensional problem. The strong convergence is proved.