Fast proximity-gradient algorithms for structured convex optimization problems (Q739473)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast proximity-gradient algorithms for structured convex optimization problems |
scientific article; zbMATH DE number 6618049
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast proximity-gradient algorithms for structured convex optimization problems |
scientific article; zbMATH DE number 6618049 |
Statements
Fast proximity-gradient algorithms for structured convex optimization problems (English)
0 references
18 August 2016
0 references
convex optimization
0 references
fixed-point proximity-gradient algorithms
0 references
image restoration
0 references
convergence acceleration
0 references
quasi-Newton method
0 references
overrelaxation
0 references
numerical experiment
0 references
0 references
0 references
0 references
0.94168824
0 references
0.9207767
0 references
0.91381997
0 references
0.9125685
0 references
0.91169256
0 references
0.91046333
0 references
0.9044898
0 references
0.90439916
0 references
