Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (Q3986751)
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 Costs and Linear Constraints |
scientific article; zbMATH DE number 29330
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints |
scientific article; zbMATH DE number 29330 |
Statements
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (English)
0 references
27 June 1992
0 references
relaxation methods
0 references
strict convexity
0 references
nondifferentiable nonseparable objective
0 references
dual coordinate ascent method
0 references
linear constraints
0 references
0.9097135066986084
0 references
0.8807631731033325
0 references
0.8580206632614136
0 references
0.8527471423149109
0 references
0.8361387252807617
0 references
