Sparse solution of overdetermined linear systems when the columns of $A$ are orthogonal

Details Sparse solution of overdetermined linear systems when the columns of $A$ are orthogonal Sparse solution of overdetermined linear systems when the columns of $A$ are orthogonal

2012-03-24

arxiv.org/abs/1203.5402v2

Statistics

Other Statistics

6 pages

Scientific paper

In this paper, we consider the problem of obtaining the best $k$-sparse solution of $Ax=y$ subject to the constraint that the columns of $A$ are orthogonal. The naive approach for obtaining a solution to this problem has exponential complexity and there exist $l_1$ regularization methods such as Lasso to obtain approximate solutions. In this paper, we show that we can obtain an exact solution to the problem, with much less computational effort compared to the brute force search when the columns of $A$ are orthogonal.

Affiliated with

Also associated with

No associations

Rating

Sparse solution of overdetermined linear systems when the columns of $A$ are orthogonal 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 Sparse solution of overdetermined linear systems when the columns of $A$ are orthogonal, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse solution of overdetermined linear systems when the columns of $A$ are orthogonal will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39050