Iterative methods for parallel convex optimization with fixed point constraints (Q5244136)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7133177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative methods for parallel convex optimization with fixed point constraints |
scientific article; zbMATH DE number 7133177 |
Statements
Iterative methods for parallel convex optimization with fixed point constraints (English)
0 references
20 November 2019
0 references
fixed point
0 references
Halpern algorithm
0 references
Krasnoselskiĭ-Mann algorithm
0 references
parallel algorithm
0 references
proximal point algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.9284048
0 references
0.92439175
0 references
0.9236429
0 references
0.92304784
0 references
0.9220359
0 references
0.9171529
0 references
0.91597426
0 references
