메뉴 건너뛰기




Volumn 2009, Issue 9, 2009, Pages

A typical reconstruction limit for compressed sensing based on L p-norm minimization

Author keywords

Analysis of algorithms; Communication; Robust and stochastic optimization; Source and channel coding; Supply and information networks

Indexed keywords


EID: 72449137292     PISSN: 17425468     EISSN: 17425468     Source Type: Journal    
DOI: 10.1088/1742-5468/2009/09/L09003     Document Type: Article
Times cited : (188)

References (28)
  • 24
    • 36849072045 scopus 로고    scopus 로고
    • Graph implementations for nonsmooth convex programs
    • Grant M and Boyd S 2008 Graph implementations for nonsmooth convex programs Recent Advances in Learning and Control (Springer Lecture Notes in Control and Information Sciences) ed V Blondel, S Boyd and H Kimura (Berlin: Springer) p95 http:// stanford.edu/∼boyd/graph-dcp.html (a tribute to MVidyasagar)
    • (2008) Recent Advances in Learning and Control , vol.371 , pp. 95
    • Grant, M.1    Boyd, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.