메뉴 건너뛰기




Volumn 437, Issue 11, 2012, Pages 2685-2712

On the geometric interpretation of the nonnegative rank

Author keywords

Computational complexity; Computational geometry; Extended formulations; Linear Euclidean distance matrices; Nested polytopes problem; Nonnegative rank; Restricted nonnegative rank

Indexed keywords

EUCLIDEAN DISTANCE MATRICES; EXTENDED FORMULATIONS; NONNEGATIVE RANK; POLYTOPES; RESTRICTED NONNEGATIVE RANK;

EID: 84865687533     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2012.06.038     Document Type: Article
Times cited : (66)

References (46)
  • 3
    • 70349789922 scopus 로고    scopus 로고
    • Real rank versus nonnegative rank
    • L. Beasley, and T. Laffey Real rank versus nonnegative rank Linear Algebra Appl. 431 12 2009 2330 2335
    • (2009) Linear Algebra Appl. , vol.431 , Issue.12 , pp. 2330-2335
    • Beasley, L.1    Laffey, T.2
  • 4
    • 0035351629 scopus 로고    scopus 로고
    • On polyhedral approximations of the second-order cone
    • A. Ben-Tal, and A. Nemirovski On polyhedral approximations of the second-order cone Math. Oper. Res. 26 2 2001 193 205
    • (2001) Math. Oper. Res. , vol.26 , Issue.2 , pp. 193-205
    • Ben-Tal, A.1    Nemirovski, A.2
  • 5
    • 47649113193 scopus 로고
    • Rank factorization of nonnegative matrices
    • A. Berman, and R. Plemmons Rank factorization of nonnegative matrices SIAM Rev. 15 3 1973 655
    • (1973) SIAM Rev. , vol.15 , Issue.3 , pp. 655
    • Berman, A.1    Plemmons, R.2
  • 9
    • 0028742731 scopus 로고
    • Geometric mixture analysis of imaging spectrometry data
    • Pasadena, Calif
    • J. Boardman, Geometric mixture analysis of imaging spectrometry data, in: Proc. IGARSS 4, Pasadena, Calif, 1994, pp. 2369-2371.
    • (1994) Proc. IGARSS 4 , pp. 2369-2371
    • Boardman, J.1
  • 10
    • 77953135649 scopus 로고    scopus 로고
    • Probability matrices, non-negative rank, and parameterization of mixture models
    • E. Carlini, and F. Rapallo Probability matrices, non-negative rank, and parameterization of mixture models Linear Algebra Appl. 433 2010 424 432
    • (2010) Linear Algebra Appl. , vol.433 , pp. 424-432
    • Carlini, E.1    Rapallo, F.2
  • 12
    • 55549091744 scopus 로고    scopus 로고
    • Low-dimensional polytope approximation and its applications to nonnegative matrix factorization
    • M. Chu, and M. Lin Low-dimensional polytope approximation and its applications to nonnegative matrix factorization SIAM J. Sci. Comput. 30 3 2008 1131 1155
    • (2008) SIAM J. Sci. Comput. , vol.30 , Issue.3 , pp. 1131-1155
    • Chu, M.1    Lin, M.2
  • 13
    • 37749030729 scopus 로고    scopus 로고
    • Hierarchical ALS algorithms for nonnegative matrix and 3D tensor factorization
    • Springer
    • A. Cichocki, R. Zdunek, and S. Amari Hierarchical ALS algorithms for nonnegative matrix and 3D tensor factorization Lecture Notes in Computer Science vol. 4666 2007 Springer 169 176
    • (2007) Lecture Notes in Computer Science , vol.4666 , pp. 169-176
    • Cichocki, A.1    Zdunek, R.2    Amari, S.3
  • 15
    • 9244259543 scopus 로고
    • Nonnegative ranks, decompositions and factorization of nonnegative matrices
    • J. Cohen, and U. Rothblum Nonnegative ranks, decompositions and factorization of nonnegative matrices Linear Algebra Appl. 190 1993 149 168
    • (1993) Linear Algebra Appl. , vol.190 , pp. 149-168
    • Cohen, J.1    Rothblum, U.2
  • 17
    • 0028427066 scopus 로고
    • Minimum-volume transforms for remotely sensed data
    • M. Craig Minimum-volume transforms for remotely sensed data IEEE Trans. Geosci. Remote Sens. 32 3 1994 542 552
    • (1994) IEEE Trans. Geosci. Remote Sens. , vol.32 , Issue.3 , pp. 542-552
    • Craig, M.1
  • 19
    • 0039920387 scopus 로고    scopus 로고
    • On the complexity of optimization problems for three-dimensional convex polyhedra and decision trees
    • G. Das, and M. Goodrich On the complexity of optimization problems for three-dimensional convex polyhedra and decision trees Comput. Geom. Theory Appl. 8 1997 123 137
    • (1997) Comput. Geom. Theory Appl. , vol.8 , pp. 123-137
    • Das, G.1    Goodrich, M.2
  • 22
    • 23744456750 scopus 로고    scopus 로고
    • When does non-negative matrix factorization give a correct decomposition into parts?
    • MIT Press
    • D. Donoho, and V. Stodden When does non-negative matrix factorization give a correct decomposition into parts? Advances in Neural Information Processing vol. 16 2003 MIT Press
    • (2003) Advances in Neural Information Processing , vol.16
    • Donoho, D.1    Stodden, V.2
  • 24
    • 74449093327 scopus 로고    scopus 로고
    • Nonnegative Factorization and the Maximum Edge Biclique Problem
    • N. Gillis, F. Glineur, Nonnegative Factorization and The Maximum Edge Biclique Problem, CORE Discussion paper 2008/64, 2008.
    • (2008) CORE Discussion Paper 2008/64
    • Gillis, N.1    Glineur, F.2
  • 25
    • 84861111031 scopus 로고    scopus 로고
    • Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization
    • N. Gillis, and F. Glineur Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization Neural Comput. 24 2012 1085 1105
    • (2012) Neural Comput. , vol.24 , pp. 1085-1105
    • Gillis, N.1    Glineur, F.2
  • 26
    • 81755168313 scopus 로고    scopus 로고
    • Dimensionality reduction, classification, and spectral mixture analysis using nonnegative underapproximation
    • N. Gillis, and R. Plemmons Dimensionality reduction, classification, and spectral mixture analysis using nonnegative underapproximation Opt. Eng. 50 2011 027001
    • (2011) Opt. Eng. , vol.50 , pp. 027001
    • Gillis, N.1    Plemmons, R.2
  • 27
    • 61349091190 scopus 로고    scopus 로고
    • Computational experiments with a linear approximation of second order cone optimization
    • Service de Mathématique et de Recherche Opérationnelle, Faculté Polytechnique de Mons
    • F. Glineur, Computational experiments with a linear approximation of second order cone optimization, Image Technical Report 0001, Service de Mathématique et de Recherche Opérationnelle, Faculté Polytechnique de Mons, 2000.
    • (2000) Image Technical Report 0001
    • Glineur, F.1
  • 29
    • 79955117417 scopus 로고
    • On Positive Vectors, Positive Matrices and the Specialization Ordering
    • H. Hazewinkel, On Positive Vectors, Positive Matrices and the Specialization Ordering, Tech. Rep., CWI Report PM-R8407, 1984.
    • (1984) Tech. Rep., CWI Report PM-R8407
    • Hazewinkel, H.1
  • 30
    • 0033099904 scopus 로고    scopus 로고
    • Multispectral and hyperspectral image analysis with convex cones
    • A. Ifarraguerri, and C.-I. Chang Multispectral and hyperspectral image analysis with convex cones IEEE Trans. Geosci.Remote Sens. 37 2 1999 756 770
    • (1999) IEEE Trans. Geosci.Remote Sens. , vol.37 , Issue.2 , pp. 756-770
    • Ifarraguerri, A.1    Chang, C.-I.2
  • 31
    • 84862597962 scopus 로고    scopus 로고
    • Extended formulations in combinatorial optimization
    • V. Kaibel Extended formulations in combinatorial optimization Optima 85 2011 2 7
    • (2011) Optima , vol.85 , pp. 2-7
    • Kaibel, V.1
  • 33
    • 58249092020 scopus 로고    scopus 로고
    • Non-negative matrix factorization: Ill-posedness and a geometric algorithm
    • B. Klingenberg, J. Curry, and A. Dougherty Non-negative matrix factorization: ill-posedness and a geometric algorithm Pattern Recognition 42 5 2009 918 928
    • (2009) Pattern Recognition , vol.42 , Issue.5 , pp. 918-928
    • Klingenberg, B.1    Curry, J.2    Dougherty, A.3
  • 35
    • 0033592606 scopus 로고    scopus 로고
    • Learning the parts of objects by nonnegative matrix factorization
    • D. Lee, and H. Seung Learning the parts of objects by nonnegative matrix factorization Nature 401 1999 788 791
    • (1999) Nature , vol.401 , pp. 788-791
    • Lee, D.1    Seung, H.2
  • 37
    • 77953135527 scopus 로고    scopus 로고
    • On the nonnegative rank of Euclidean distance matrices
    • M. Lin, and M. Chu On the nonnegative rank of Euclidean distance matrices Linear Algebra Appl. 433 3 2010 681 689
    • (2010) Linear Algebra Appl. , vol.433 , Issue.3 , pp. 681-689
    • Lin, M.1    Chu, M.2
  • 38
    • 84865701922 scopus 로고
    • Separation and approximation of polyhedral surfaces
    • J. Mitchell, and S. Suri Separation and approximation of polyhedral surfaces Oper. Res. Lett. 11 1992 255 259
    • (1992) Oper. Res. Lett. , vol.11 , pp. 255-259
    • Mitchell, J.1    Suri, S.2
  • 39
    • 49349132396 scopus 로고
    • Contentment in graph theory: Covering graphs with cliques
    • J. Orlin Contentment in graph theory: covering graphs with cliques Indag. Math. (Proceedings) 80 5 1977 406 424
    • (1977) Indag. Math. (Proceedings) , vol.80 , Issue.5 , pp. 406-424
    • Orlin, J.1
  • 40
    • 0141998079 scopus 로고    scopus 로고
    • The maximum edge biclique problem is NP-complete
    • R. Peeters The maximum edge biclique problem is NP-complete Discrete Appl. Math. 131 3 2003 651 654
    • (2003) Discrete Appl. Math. , vol.131 , Issue.3 , pp. 651-654
    • Peeters, R.1
  • 41
    • 0039889366 scopus 로고
    • Rank factorization of nonnegative matrices
    • L. Thomas Rank factorization of nonnegative matrices SIAM Rev. 16 3 1974 393 394
    • (1974) SIAM Rev. , vol.16 , Issue.3 , pp. 393-394
    • Thomas, L.1
  • 42
    • 73249153369 scopus 로고    scopus 로고
    • On the complexity of nonnegative matrix factorization
    • S. Vavasis On the complexity of nonnegative matrix factorization SIAM J. Optim. 20 2009 1364 1377
    • (2009) SIAM J. Optim. , vol.20 , pp. 1364-1377
    • Vavasis, S.1
  • 43
    • 34249918442 scopus 로고
    • Finding minimal nested polygons
    • C. Wang Finding minimal nested polygons BIT 31 1991 230 236
    • (1991) BIT , vol.31 , pp. 230-236
    • Wang, C.1
  • 44
    • 33748335457 scopus 로고    scopus 로고
    • Fractional biclique covers and partitions of graphs
    • V. Watts Fractional biclique covers and partitions of graphs Electron. J. Combin. 13 2006 #R74
    • (2006) Electron. J. Combin. , vol.13 , pp. 74
    • Watts, V.1
  • 45
    • 0026390010 scopus 로고
    • Expressing combinatorial optimization problems by linear programs
    • M. Yannakakis Expressing combinatorial optimization problems by linear programs Comput. System Sci. 43 1991 441 466
    • (1991) Comput. System Sci. , vol.43 , pp. 441-466
    • Yannakakis, M.1


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