Relaxation methods for problems with strictly convex separable costs and linear constraints (Q3777809)
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: Relaxation methods for problems with strictly convex separable costs and linear constraints |
scientific article; zbMATH DE number 4037614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relaxation methods for problems with strictly convex separable costs and linear constraints |
scientific article; zbMATH DE number 4037614 |
Statements
Relaxation methods for problems with strictly convex separable costs and linear constraints (English)
0 references
1987
0 references
Fenchel duality
0 references
strictly convex, possibly nondifferentiable, separable cost
0 references
linear constraints
0 references
unconstrained minimization
0 references
parallel methods
0 references
Gauss-Seidel relaxation
0 references
0 references
0.8807631731033325
0 references
0.8643037676811218
0 references
0.8378981351852417
0 references
0.8340432047843933
0 references
0.8232443928718567
0 references
