A class of convergent primal-dual subgradient algorithms for decomposable convex programs (Q3725884): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01580881 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1970720280 / rank | |||
Normal rank | |||
Latest revision as of 10:38, 30 July 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
0 references
