A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing

Details A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing

2009-07-20

arxiv.org/abs/0907.3340v1

Computer Science

Numerical Analysis

Scientific paper

Problems in signal processing and medical imaging often lead to calculating sparse solutions to under-determined linear systems. Methodologies for solving this problem are presented as background to the method used in this work where the problem is reformulated as an unconstrained convex optimization problem. The least squares approach is modified by an $l_1$-regularization term. A sparse solution is sought using a Barzilai-Borwein type projection algorithm with an adaptive step length. New insight into the choice of step length is provided through a study of the special structure of the underlying problem. Numerical experiments are conducted and results given, comparing this algorithm with a number of other current algorithms.

Affiliated with

Also associated with

No associations

Rating

A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing 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 A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696031