On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s13675-015-0048-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2149119057 / rank | |||
Normal rank | |||
Revision as of 00:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems |
scientific article |
Statements
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (English)
0 references
19 May 2016
0 references
non-smooth convex minimization
0 references
alternating proximal methods
0 references
coordinate descent
0 references
non-asymptotic rate of convergence
0 references
