A dynamical approach to two-block separable convex optimization problems with linear constraints (Q4985172)
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: A dynamical approach to two-block separable convex optimization problems with linear constraints |
scientific article; zbMATH DE number 7336633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamical approach to two-block separable convex optimization problems with linear constraints |
scientific article; zbMATH DE number 7336633 |
Statements
A Dynamical Approach to Two-Block Separable Convex Optimization Problems with Linear Constraints (English)
0 references
22 April 2021
0 references
convex optimization
0 references
duality
0 references
dynamical system
0 references
Lyapunov analysis
0 references
Lagrangian
0 references
primal dual algorithm
0 references
proximal AMA
0 references
saddle points
0 references
structured convex minimization
0 references
subdifferential
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7864667773246765
0 references
0.7826786041259766
0 references
0.7555054426193237
0 references
0.7422893643379211
0 references
0.7412916421890259
0 references
