Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (Q3986751): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.16.3.462 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989970904 / rank | |||
Normal rank | |||
Latest revision as of 20:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints |
scientific article |
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
