Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530): Difference between revisions
From MaRDI portal
Latest revision as of 01:16, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings |
scientific article |
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
