On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800)
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: On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression |
scientific article |
Statements
On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (English)
0 references
28 September 2021
0 references
proximal gradient method
0 references
DC algorithms
0 references
proximal alternating linearized minimization
0 references
d-stationary points
0 references
critical points
0 references
0 references
0 references
0 references
0.7640705108642578
0 references
0.7585328221321106
0 references
0.743134617805481
0 references
0.739262044429779
0 references
