On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming |
scientific article |
Statements
On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (English)
0 references
10 May 2022
0 references
nonlinear convex cone programming
0 references
first-order method
0 references
primal-dual method
0 references
augmented Lagrangian function
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
