Sparse recovery under nonnegativity and sum-to-one constraints
From MaRDI portal
Publication:6576943
DOI10.1016/j.ins.2024.121059zbMATH Open1545.94034MaRDI QIDQ6576943
H. C. So, XiaoPeng Li, Chi-Sing Leung
Publication date: 23 July 2024
Published in: Information Sciences (Search for Journal in Brave)
Factor analysis and principal components; correspondence analysis (62H25) Ridge regression; shrinkage estimators (Lasso) (62J07) Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Paired and multiple comparisons; multiple testing (62J15)
Cites Work
- Unnamed Item
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- Kernel search: an application to the index tracking problem
- Regression modeling strategies. With applications to linear models, logistic regression, and survival analysis
- MM algorithms for generalized Bradley-Terry models.
- Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm
- A theoretical result of sparse signal recovery via alternating projection method
- Robust principal component analysis?
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Projected gradient methods for linearly constrained problems
- High-Resolution Radar via Compressed Sensing
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Sparse Portfolios for High-Dimensional Financial Index Tracking
- Learning Proximal Operator Methods for Nonconvex Sparse Recovery with Theoretical Guarantee
- Non-Negative Orthogonal Greedy Algorithms
- A Signal Processing Perspective of Financial Engineering
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Compressed sensing
- Rocs: robust one-bit compressed sensing with application to direction of arrival
This page was built for publication: Sparse recovery under nonnegativity and sum-to-one constraints