Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

L1 minimization using ADMM #6

Open
3 of 8 tasks
shailesh1729 opened this issue Jun 4, 2021 · 0 comments
Open
3 of 8 tasks

L1 minimization using ADMM #6

shailesh1729 opened this issue Jun 4, 2021 · 0 comments

Comments

@shailesh1729
Copy link
Collaborator

shailesh1729 commented Jun 4, 2021

This work provides implementations of algorithms in the paper: ALTERNATING DIRECTION ALGORITHMS FOR ℓ1-PROBLEMS IN COMPRESSIVE SENSING by Junfeng Yang and Yin Zhang.

Algorithms:

  • Solve basis pursuit (1.3)
  • Solve basis pursuit with inequality constraints (1.4)
  • Solve basis pursuit denoising (1.5)
  • Solve l_1/l_1 problem (1.6)

We also need to implement corresponding non-negative counterparts.

Evaluation:

  • Recovery results from data corrupted by impulsive noise only
  • Recovery results from data corrupted by white noise only
  • Recovery results from data corrupted by both white and impulsive noise
  • Relative error vs optimality for noiseless and noisy data
@shailesh1729 shailesh1729 added this to the 0.1 milestone Jun 4, 2021
@carnot-shailesh carnot-shailesh moved this from To do to In study in Algorithms development board Jun 28, 2021
@carnot-shailesh carnot-shailesh moved this from In study to In development in Algorithms development board Jun 28, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
Development

No branches or pull requests

1 participant