• DocumentCode
    106575
  • Title

    Improved analysis of greedy block coordinate descent under RIP

  • Author

    Haifeng Li ; Yingbin Ma ; WenAn Liu ; Yuli Fu

  • Author_Institution
    Coll. of Math. & Inf. Sci., Henan Normal Univ., Xinxiang, China
  • Volume
    51
  • Issue
    6
  • fYear
    2015
  • fDate
    3 19 2015
  • Firstpage
    488
  • Lastpage
    490
  • Abstract
    A more relaxed condition means that fewer of measurements are needed to ensure the exact sparse recovery from the theoretical aspect. The sufficient condition for the greedy block coordinate descent (GBCD) algorithm is relaxed using the near-orthogonality property. It is also shown that the GBCD algorithm fails when (1/(√K+1)≤δK+1<;1).
  • Keywords
    direction-of-arrival estimation; sparse matrices; DOA estimation; GBCD algorithm; MMV model; RIP; greedy block coordinate descent; multiple measurements vectors; near-orthogonality property; restricted isometry property; sparse recovery; sufficient condition;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el.2014.3756
  • Filename
    7062168
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=106575