Iteration methods to compute the separable convex minimization problems (Q2969317)
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 6694793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iteration methods to compute the separable convex minimization problems |
scientific article; zbMATH DE number 6694793 |
Statements
ITERATION METHODS TO COMPUTE THE SEPARABLE CONVEX MINIMIZATION PROBLEMS (English)
0 references
14 March 2017
0 references
iteration method
0 references
global convergence
0 references
linear constraints
0 references
0.8114327788352966
0 references
0.7940738201141357
0 references
0.7936286330223083
0 references
0.7842957377433777
0 references
