Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530)
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: Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings |
scientific article; zbMATH DE number 6585790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings |
scientific article; zbMATH DE number 6585790 |
Statements
Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (English)
0 references
26 May 2016
0 references
fixed point
0 references
Krasnosel'skiĭ-Mann algorithm
0 references
nonexpansive mapping
0 references
nonsmooth convex optimization
0 references
parallel algorithm
0 references
subgradient
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
