Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1506.05320 / rank | |||
Normal rank | |||
Revision as of 19:13, 19 April 2024
scientific article; zbMATH DE number 7024421
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming |
scientific article; zbMATH DE number 7024421 |
Statements
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (English)
0 references
18 February 2019
0 references
conic convex problems
0 references
smooth (augmented) dual functions
0 references
penalty functions
0 references
(augmented) dual first-order methods
0 references
penalty fast gradient methods
0 references
approximate primal solution
0 references
overall computational complexity
0 references
