Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints (Q6100752): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s41980-023-00778-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S41980-023-00778-4 / rank | |||
Normal rank | |||
Latest revision as of 18:27, 30 December 2024
scientific article; zbMATH DE number 7700385
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
