English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Recently, the worse-case analysis, probabilistic analysis and empirical justification have been employed to address the fundamental question: When does &#x2113;1-minimization find the sparsest solution to an underdetermined linear system? In this paper, a deterministic analysis, rooted in the classic linear programming theory, is carried out to further address this question. We first identify a necessary and sufficient condition for the uniqueness of least &#x2113;1-norm solutions to linear systems. From this condition, we deduce that a sparsest solution coincides with the unique least &#x2113;1-norm solution to a linear system if and only if the so-called range space property (RSP) holds at this solution. This yields a broad understanding of the relationship between &#x2113;0- and &#x2113;1-minimization problems. Our analysis indicates that the RSP truly lies at the heart of the relationship between these two problems. Through RSP-based analysis, several important questions in this field can be largely addressed. For instance, how to efficiently interpret the gap between the current theory and the actual numerical performance of &#x2113;1-minimization by a deterministic analysis, and if a linear system has multiple sparsest solutions, when does &#x2113;1-minimization guarantee to find one of them? Moreover, new matrix properties (such as the RSP of order K and the Weak-RSP of order K) are introduced in this paper, and a new theory for sparse signal recovery based on the RSP of order K is established.

ieee transactions on signal processing

RSP-Based Analysis for Sparsest and Least <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Norm Solutions to Underdetermined Linear Systems

RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems