\`x^2+y_1+z_12^34\`
Advanced Search
Advanced Search
Advanced Search
This issue Previous Article Next Article
Article Contents
Article Contents
2009, Volume 3, Issue 3: 487-503. Doi: 10.3934/ipi.2009.3.487 open access
This issue Previous Article Perfect and almost perfect pulse compression codes for range spread radar targets Next Article Regularity and identification for an integrodifferential one-dimensional hyperbolic equation

Coordinate descent optimization for l1 minimization with application to compressed sensing; a greedy algorithm

  • 1.

    UCLA Mathematics Department, Box 951555, Los Angeles, CA 90095-1555

Received:  January 31, 2009
Revised:  May 31, 2009
Published:  July 2009
Abstract Related Papers Cited by
    Abstract
  • We propose a fast algorithm for solving the Basis Pursuit problem, minu $\{|u|_1\: \Au=f\}$, which has application to compressed sensing. We design an efficient method for solving the related unconstrained problem minu $E(u) = |u|_1 + \lambda \||Au-f\||^2_2$ based on a greedy coordinate descent method. We claim that in combination with a Bregman iterative method, our algorithm will achieve a solution with speed and accuracy competitive with some of the leading methods for the basis pursuit problem.
    Mathematics Subject Classification: Primary: 90C25; Secondary: 65K05.

    Citation:
    shu

    \begin{equation} \\ \end{equation}
    • Related Papers
  • Cited by
  • Access History
  • 加载中
Open Access Under a Creative Commons license
PDF
XML
Export Citation
SHARE
Email to a Friend

Article Metrics

HTML views() PDF downloads(1218) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return
    Site map Copyright © 2022 American Institute of Mathematical Sciences