Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach (Q3034446)
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 4133005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach |
scientific article; zbMATH DE number 4133005 |
Statements
Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach (English)
0 references
1990
0 references
strictly convex
0 references
network flow
0 references
entropy maximization
0 references
quadratic program
0 references
parallel computation
0 references
block coordinate ascent method
0 references
dual coordinate ascent methods
0 references
dual gradient methods
0 references
0.8539624214172363
0 references
0.8527471423149109
0 references
0.8457279205322266
0 references
0.8457279205322266
0 references
0.8266777396202087
0 references
