Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem (Q1725170)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem |
scientific article; zbMATH DE number 7023229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem |
scientific article; zbMATH DE number 7023229 |
Statements
Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem (English)
0 references
14 February 2019
0 references
Summary: As is known, the regularization method plays an important role in solving constrained convex minimization problems. Based on the idea of regularization, implicit and explicit iterative algorithms are proposed in this paper and the sequences generated by the algorithms can converge strongly to a solution of the constrained convex minimization problem, which also solves a certain variational inequality. As an application, we also apply the algorithm to solve the split feasibility problem.
0 references
strong convergence
0 references
implicit iterative algorithms
0 references
split feasibility problem
0 references
regularisation method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9386446475982666
0 references
0.873447060585022
0 references
0.8598464131355286
0 references
0.8299592137336731
0 references
