Sparse recovery under nonnegativity and sum-to-one constraints

DOI10.1016/J.INS.2024.121059MaRDI QIDQ6576943zbMATH OpenFDO

Authors X. P. Li, Chi-Sing Leung, H. C. So

Publication date 23 July 2024

Published in Information Sciences (Search for Journal in Brave)

zbMATH Keywords

sparse recoveryhyperspectral unmixingnon-negativesparse index trackingsum-to-one

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Numerical mathematical programming methods (65K05) Ridge regression; shrinkage estimators (Lasso) (62J07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Paired and multiple comparisons; multiple testing (62J15)

Recommendations

• Non-negative sparse recovery via momentum-boosted adaptive thresholding algorithm
• Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery
• Methods for sparse and low-rank recovery under simplex constraints
• The non-convex sparse problem with nonnegative constraint for signal reconstruction
• A method for finding structured sparse solutions to nonnegative least squares problems with applications

Cites work

• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• A signal processing perspective on financial engineering
• A theoretical result of sparse signal recovery via alternating projection method
• Compressed sensing
• High-Resolution Radar via Compressed Sensing
• Kernel search: an application to the index tracking problem
• Learning Proximal Operator Methods for Nonconvex Sparse Recovery with Theoretical Guarantee
• MM algorithms for generalized Bradley-Terry models.
• Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
• Non-Negative Orthogonal Greedy Algorithms
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Projected gradient methods for linearly constrained problems
• Regression modeling strategies. With applications to linear models, logistic regression, and survival analysis
• Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm
• Robust principal component analysis?
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Rocs: robust one-bit compressed sensing with application to direction of arrival
• Sparse Portfolios for High-Dimensional Financial Index Tracking
• The Adaptive Lasso and Its Oracle Properties

Cited in

(1)

• Non-negative sparse recovery via momentum-boosted adaptive thresholding algorithm

This page was built for publication: Sparse recovery under nonnegativity and sum-to-one constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576943)