Computer Science – Information Theory
Scientific paper
2011-10-05
Computer Science
Information Theory
Scientific paper
In this paper, we employ fixed point theory and semidefinite programming to compute the performance bounds on convex block-sparsity recovery algorithms. As a prerequisite for optimal sensing matrix design, a computable performance bound would open doors for wide applications in sensor arrays, radar, DNA microarrays, and many other areas where block-sparsity arises naturally. We define a family of goodness measures for arbitrary sensing matrices as the optimal values of certain optimization problems. The reconstruction errors of convex recovery algorithms are bounded in terms of these goodness measures. We demonstrate that as long as the number of measurements is relatively large, these goodness measures are bounded away from zero for a large class of random sensing matrices, a result parallel to the probabilistic analysis of the block restricted isometry property. As the primary contribution of this work, we associate the goodness measures with the fixed points of functions defined by a series of semidefinite programs. This relation with fixed point theory yields efficient algorithms with global convergence guarantees to compute the goodness measures.
Nehorai Arye
Tang Gongguo
No associations
LandOfFree
Fixed point theory and semidefinite programming for computable performance analysis of block-sparsity recovery does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fixed point theory and semidefinite programming for computable performance analysis of block-sparsity recovery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed point theory and semidefinite programming for computable performance analysis of block-sparsity recovery will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-325989