Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints (Q6100752)
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 7700385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints |
scientific article; zbMATH DE number 7700385 |
Statements
Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints (English)
0 references
22 June 2023
0 references
convex programming
0 references
primal-dual hybrid gradient method
0 references
global convergence
0 references
convergence rate
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8037399649620056
0 references
0.8024435639381409
0 references
0.7687910795211792
0 references
0.7634003162384033
0 references
0.7618406414985657
0 references
