메뉴 건너뛰기




Volumn 102, Issue 27, 2005, Pages 9446-9451

Sparse nonnegative solution of underdetermined linear equations by linear programming

Author keywords

Combinatorial optimization; Convex hull of Gaussian samples; Cyclic polytopes; Neighborly polytopes; Positivity constraints in ill posed problems

Indexed keywords

ARTICLE; LINEAR SYSTEM; MATHEMATICS; PRIORITY JOURNAL; PROBABILITY;

EID: 22144488449     PISSN: 00278424     EISSN: None     Source Type: Journal    
DOI: 10.1073/pnas.0502269102     Document Type: Article
Times cited : (447)

References (20)
  • 1
    • 0004291883 scopus 로고    scopus 로고
    • Graduate Texts in Mathematics (Springer, New York), 2nd Ed.
    • Grünbaum, B. (2003) Convex Polytopes, Graduate Texts in Mathematics (Springer, New York), 2nd Ed., Vol. 221.
    • (2003) Convex Polytopes , vol.221
    • Grünbaum, B.1
  • 2
    • 0004159676 scopus 로고
    • Graduate Texts in Mathematics (Springer, New York)
    • Ziegler, G. M. (1995) Lectures on Polytopes, Graduate Texts in Mathematics (Springer, New York), Vol. 152.
    • (1995) Lectures on Polytopes , vol.152
    • Ziegler, G.M.1
  • 3
    • 0002670267 scopus 로고
    • Annals of Mathematics Studies (Princeton Univ. Press, Princeton)
    • Gale, D. (1956) in Linear Inequalities and Related Systems. Annals of Mathematics Studies (Princeton Univ. Press, Princeton), No. 38, pp. 255-263.
    • (1956) Linear Inequalities and Related Systems , vol.38 , pp. 255-263
    • Gale, D.1
  • 17


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