Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem (Q2097697)
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: Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem |
scientific article |
Statements
Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem (English)
0 references
14 November 2022
0 references
linearly constrained convex optimization problem
0 references
primal-dual algorithm
0 references
inertial primal-dual dynamical system
0 references
convergence rate
0 references
Nesterov's acceleration
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8631876707077026
0 references
0.8462375998497009
0 references
0.8325075507164001
0 references
0.8293387293815613
0 references
