A proximal point dual Newton algorithm for solving group graphical Lasso problems (Q5116554)
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: A proximal point dual Newton algorithm for solving group graphical Lasso problems |
scientific article; zbMATH DE number 7236504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proximal point dual Newton algorithm for solving group graphical Lasso problems |
scientific article; zbMATH DE number 7236504 |
Statements
A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems (English)
0 references
18 August 2020
0 references
group graphical Lasso
0 references
proximal point algorithm
0 references
semismooth Newton method
0 references
Lipschitz continuity
0 references
0 references
0 references
0 references
0 references
0 references
0.8332274556159973
0 references
0.7754384875297546
0 references
0.7678120136260986
0 references
0.7573468685150146
0 references
0.7525164484977722
0 references
