A High-resolution DOA Estimation Method with a Family of Nonconvex Penalties
Xiaohuan Wu, Wei-Ping Zhu, Jun Yan

TL;DR
This paper introduces a novel high-resolution DOA estimation method using nonconvex penalties on the covariance matrix's singular values, improving sparsity and resolution over traditional convex approaches.
Contribution
It proposes a nonconvex minimization framework with iterative reweighted strategy for better DOA estimation, surpassing nuclear norm relaxation methods.
Findings
Achieves higher resolution in DOA estimation.
Demonstrates superior performance through extensive simulations.
Provides efficient algorithms for practical implementation.
Abstract
The low-rank matrix reconstruction (LRMR) approach is widely used in direction-of-arrival (DOA) estimation. As the rank norm penalty in an LRMR is NP-hard to compute, the nuclear norm (or the trace norm for a positive semidefinite (PSD) matrix) has been often employed as a convex relaxation of the rank norm. However, solving a nuclear norm convex problem may lead to a suboptimal solution of the original rank norm problem. In this paper, we propose to apply a family of nonconvex penalties on the singular values of the covariance matrix as the sparsity metrics to approximate the rank norm. In particular, we formulate a nonconvex minimization problem and solve it by using a locally convergent iterative reweighted strategy in order to enhance the sparsity and resolution. The problem in each iteration is convex and hence can be solved by using the optimization toolbox. Convergence analysis…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Direction-of-Arrival Estimation Techniques · Structural Health Monitoring Techniques
