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 the normal view instead:
scientific article; zbMATH DE number 7524839
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming |
scientific article; zbMATH DE number 7524839 |
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
0 references
0.8033814430236816
0 references
0.800581693649292
0 references
0.7991871237754822
0 references
0.7871221899986267
0 references
