Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
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.
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- Iterative approximation of solutions for constrained convex minimization problem
- scientific article; zbMATH DE number 5310524
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- A general iterative scheme with applications to convex optimization and related fields
- Iterative schemes for convex minimization problems with constraints
- Iterative algorithm for approximating solutions of maximal monotone operators in Hilbert spaces
- scientific article; zbMATH DE number 3892945
- Iterative regularization method with a proximal operator
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- Convergence analysis of penalty decomposition algorithm for cardinality constrained convex optimization in Hilbert spaces
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- scientific article; zbMATH DE number 1046214 (Why is no real title available?)
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- Optimization and approximation for polyhedra in separable Hilbert spaces
- Adaptive Optimization of Convex Functionals in Banach Spaces
- Constraint Aggregation in Infinite-Dimensional Spaces and Applications
- Iterative algorithms for data assimilation problems
This page was built for publication: Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954737)
