Non-monotonous sequential subgradient projection algorithm for convex feasibility problem (Q519264)
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 6700454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-monotonous sequential subgradient projection algorithm for convex feasibility problem |
scientific article; zbMATH DE number 6700454 |
Statements
Non-monotonous sequential subgradient projection algorithm for convex feasibility problem (English)
0 references
4 April 2017
0 references
subgradient projection algorithm
0 references
non-monotonous technique
0 references
convex feasibility problem
0 references
0 references
0 references
0 references
0 references
0.8843304514884949
0 references
0.8722076416015625
0 references
0.848094642162323
0 references
0.8336896896362305
0 references
