Hybrid proximal point algorithms for solving constrained minimization problems in Banach spaces (Q2389017)
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: Hybrid proximal point algorithms for solving constrained minimization problems in Banach spaces |
scientific article; zbMATH DE number 5582188
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid proximal point algorithms for solving constrained minimization problems in Banach spaces |
scientific article; zbMATH DE number 5582188 |
Statements
Hybrid proximal point algorithms for solving constrained minimization problems in Banach spaces (English)
0 references
22 July 2009
0 references
The purpose of this paper is to introduce two hybrid proximal point algorithms to solve the constrained minimization problem for a convex functional in a uniformly convex and uniformly smooth Banach space. Using these iterative schemes, we establish the strong convergence theorems for relatively nonexpansive mappings which generalize the recent results in the literature.
0 references
hybrid proximal point algorithm
0 references
convex functional
0 references
relatively nonexpansive mapping
0 references
constrained minimization problem
0 references
strong convergence
0 references
generalized projection
0 references
0.874962568283081
0 references
0.837721586227417
0 references
0.8362767100334167
0 references