Relaxation methods for problems with strictly convex separable costs and linear constraints (Q3777809): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q535017 |
Changed an Item |
||
| Property / author | |||
| Property / author: Paul Tseng / rank | |||
Normal rank | |||
Revision as of 23:34, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relaxation methods for problems with strictly convex separable costs and linear constraints |
scientific article |
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
