Dear Igor,
browsing through the sparse signal recovery solver list on your (great!) CS blog, I noticed that ours is missing, so I figured I'd write you an email. :-)
Namely, it's the "Infeasible-Point Subgradient Algorithm for L1-Minimization", or "ISAL1" for short, that by Dirk Lorenz, Marc Pfetsch and I developed. It can be found on the homepage of our "SPEAR" (Sparse Exact and Approximate Recovery" project, which is www.math.tu-bs.de/mo/spear ; a direct link to the (current) Matlab toolbox is
On that project page, there's also the accompanying papers (theoretical background and solver comparison) and a testset for L1 problems, etc.
I'd much appreciate it, if you could include the ISAL1 solver in the list on Nuit Blanche's CS pages! Currently, ISAL1 solves only standard basis pursuit problems, but it is planned to be extended to other similar problems (e.g. denoising) in the not-too-far future. (so maybe a link to the project page instead of the direct link would make more sense, due to likely version changes)
Hoping to hear from you soon,
Cheers
Andreas
Thanks Andreas, problem solved, it is now on the sparse recovery section of the big picture in compressive sensing. Their SPARS11 poster is here.
Liked this entry ? subscribe to the Nuit Blanche feed, there's more where that came from
No comments:
Post a Comment