A first-order optimization algorithm for statistical learning with hierarchical sparsity structure
| Year of publication: |
2022
|
|---|---|
| Authors: | Zhang, Dewei ; Liu, Yin ; Davanloo Tajbakhsh, Sam |
| Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 2, p. 1126-1140
|
| Subject: | alternating direction method of multipliers | error bound theory | hierarchical sparsity structure | latent overlapping group lasso | proximal methods | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Fast proximal algorithms for nonsmooth convex optimization
Ouorou, Adam, (2020)
-
An augmented lagrangian decomposition method for chance-constrained optimization problems
Bai, Xiaodi, (2021)
-
Numerical study of learning algorithms on Stiefel manifold
Kanamori, Takafumi, (2014)
- More ...
-
Liu, Yin, (2021)
-
Risk based weight determination in multiple criteria decision making
Liu, Yin, (2025)
-
Liu, Yin, (2021)
- More ...