Supermemory gradient methods for monotone nonlinear equations with convex constraints (Q520272)
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: Supermemory gradient methods for monotone nonlinear equations with convex constraints |
scientific article; zbMATH DE number 6699572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Supermemory gradient methods for monotone nonlinear equations with convex constraints |
scientific article; zbMATH DE number 6699572 |
Statements
Supermemory gradient methods for monotone nonlinear equations with convex constraints (English)
0 references
3 April 2017
0 references
monotone equations
0 references
supermemory gradient method
0 references
projection method
0 references
global convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8522082567214966
0 references
0.8395423889160156
0 references
0.8389503955841064
0 references
0.8337819576263428
0 references
0.8313688635826111
0 references
