A fast dual proximal gradient algorithm for convex minimization and applications (Q1667162)
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 6927798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast dual proximal gradient algorithm for convex minimization and applications |
scientific article; zbMATH DE number 6927798 |
Statements
A fast dual proximal gradient algorithm for convex minimization and applications (English)
0 references
27 August 2018
0 references
dual-based methods
0 references
fast gradient methods
0 references
convex optimization
0 references
rate of convergence
0 references
0 references
0 references
0 references
0.8469045758247375
0 references
0.832105278968811
0 references
0.8280044794082642
0 references
0.8167937397956848
0 references
