ModelDB: Paper information

Edelman A, Arias TA, Smith ST. (1998). The geometry of algorithms with orthogonality constraints SIAM J Matrix Anal Appl. 20

See more from authors: Edelman A · Arias TA · Smith ST

References and models cited by this paper

References and models that cite this paper

Oja E, Plumbley M. (2004). Blind separation of positive sources by globally convergent gradient search. Neural computation. 16 [PubMed]

Xu L. (2007). One-bit-matching theorem for ICA, convex-concave programming on polyhedral set, and distribution approximation for combinatorics. Neural computation. 19 [PubMed]