Incremental subgradient method for nonsmooth convex optimization with fixed point constraints (Q2829569)
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: Incremental subgradient method for nonsmooth convex optimization with fixed point constraints |
scientific article; zbMATH DE number 6648967
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Incremental subgradient method for nonsmooth convex optimization with fixed point constraints |
scientific article; zbMATH DE number 6648967 |
Statements
Incremental subgradient method for nonsmooth convex optimization with fixed point constraints (English)
0 references
8 November 2016
0 references
fixed point
0 references
incremental subgradient method
0 references
Krasnosel'skiĭ-Mann algorithm
0 references
nonexpansive mapping
0 references
nonsmooth convex optimization
0 references
subdifferential
0 references
Hilbert space
0 references
convergence
0 references
numerical example
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8972741365432739
0 references
0.8913403153419495
0 references
0.861402153968811
0 references
0.8554604053497314
0 references
