Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints (Q6100752): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s41980-023-00778-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4366261617 / rank | |||
Normal rank | |||
Revision as of 08:22, 30 July 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
