LZLi Zhu
Li Zhu
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Li Zhu has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Cui Jia
School of Statistics and Data Science, Ningbo University of Technology, No. 201, Fenghua Road, Jiangbei District, Ningbo 315211, China
1 shared publication
Latest Publications
- Open Access
- 10 July 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (14) , 2168
Data-Driven Method for Robust Recovery in 1-Bit Compressive Sensing with the Minimax Concave Penalty
With the advent of large-scale data, the demand for information is increasing, which makes signal sampling technology and digital processing methods particularly important. The utilization of 1-bit compressive sensing in sparse recovery has garnered significant attention due to its cost-effectiveness in hardware implementation and storage. In this paper, we first leverage the minimax concave penalty equipped with the least squares to recover a high-dimensional true signal with k-sparse from n-dimensional 1-bit measurements and discuss the regularization by combing the nonconvex sparsity-inducing penalties. Moreover, we give an analysis of the complexity of the method with minimax concave penalty in certain conditions and derive the general theory for the model equipped with the family of sparsity-inducing nonconvex functions. Then, our approach employs a data-driven Newton-type method with stagewise steps to solve the proposed method. Numerical experiments on the synthesized and real data verify the competitiveness of the proposed method.- 10 July 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (14) , 2168
Open AccessData-Driven Method for Robust Recovery in 1-Bit Compressive Sensing with the Minimax Concave Penalty
With the advent of large-scale data, the demand for information is increasing, which makes signal sampling technology and digital processing methods particularly important. The utilization of 1-bit compressive sensing in sparse recovery has garnered significant attention due to its cost-effectiveness in hardware implementation and storage. In this paper, we first leverage the minimax concave penalty equipped with the least squares to recover a high-dimensional true signal with k-sparse from n-dimensional 1-bit measurements and discuss the regularization by combing the nonconvex sparsity-inducing penalties. Moreover, we give an analysis of the complexity of the method with minimax concave penalty in certain conditions and derive the general theory for the model equipped with the family of sparsity-inducing nonconvex functions. Then, our approach employs a data-driven Newton-type method with stagewise steps to solve the proposed method. Numerical experiments on the synthesized and real data verify the competitiveness of the proposed method.