A class of convergent primal-dual subgradient algorithms for decomposable convex programs (Q3725884): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:08, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of convergent primal-dual subgradient algorithms for decomposable convex programs |
scientific article |
Statements
A class of convergent primal-dual subgradient algorithms for decomposable convex programs (English)
0 references
1986
0 references
primal-dual subgradient algorithm
0 references
nondifferentiable
0 references
convex programming
0 references
Lagrangian dual function
0 references
penalty function
0 references
stopping criterion
0 references
