Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (Q3986751): 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 22:34, 15 February 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
