Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887)
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: Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming |
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
0 references
0 references
0 references
0 references
0 references
0 references
