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 the normal view instead:
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
We consider the minimization problem with strictly convex, possibly nondifferentiable, separable cost and linear constraints. The dual of this problem is an unconstrained minimization problem with differentiable cost which is well suited for solution by parallel methods based on Gauss-Seidel relaxation. We show that these methods yield the optimal primal solution and, under additional assumptions, an optimal dual solution. To do this it is necessary to extend the classical Gauss-Seidel convergence results because the dual cost may not be strictly convex, and may have unbounded level sets.
0 references