On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization (Q4286937): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.18.4.846 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2153745131 / rank | |||
Normal rank | |||
Latest revision as of 20:33, 19 March 2024
scientific article; zbMATH DE number 549165
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization |
scientific article; zbMATH DE number 549165 |
Statements
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization (English)
0 references
19 January 1995
0 references
convergence rate
0 references
dual ascent methods
0 references
linearly constrained convex minimization
0 references
