Premium
An alternating l1 approach to the compressed sensing problem
Author(s) -
Chrétien Stéphane
Publication year - 2007
Publication title -
pamm
Language(s) - English
Resource type - Journals
ISSN - 1617-7061
DOI - 10.1002/pamm.200700116
Subject(s) - compressed sensing , relaxation (psychology) , lagrangian relaxation , simple (philosophy) , lagrangian , duality (order theory) , algorithm , computer science , mathematics , mathematical optimization , combinatorics , philosophy , epistemology , psychology , social psychology
Abstract The purpose of this note is to present a simple algorithm motivated by Lagrangian duality and generalizing the l1‐relaxation approach to the recent Compressed Sensing (CS) problem introduced by Candes, Romberg and Tao. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)