Exact sparse reconstruction form Vandermonde matrices

2017/06/18 by Wang, Changlong, Zhou, Feng
#FOS: Mathematics #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1706.05694

Abstract

As a conclusion in classical linear algebra, an underdetermined linear equations usually have an infinite number of solutions. The sparest one among these solutions is significant in many applications. This problem can be modeled as the l₀-minimization, However, to find the sparsest solution of an underdetermined linear equations is NP-hard. Therefore, an important approach to solve the following l_p-minimization (0

Related

• Sparse Solutions of a Class of Constrained Optimization Problems
• Sparse Approximate Solutions to Linear Systems
• A fast algorithm for computing minimal-norm solutions to underdetermined systems of linear equations
• Linear under-determined systems with sparse solutions: Redirecting a challenge?
• Sparse solution of overdetermined linear systems when the columns of A are orthogonal