Non-negative matrix factorization: Difference between revisions

Revision as of 19:31, 22 April 2021

Revision as of 15:13, 5 May 2021

Line 205:

| url =https://smallk.github.io/papers/nmf_review_jgo.pdf

| doi=10.1007/s10898-013-0035-4

|s2cid=11197117 }}</ref>| doi-access =free

}}</ref>

Current algorithms are sub-optimal in that they only guarantee finding a local minimum, rather than a global minimum of the cost function. A provably optimal algorithm is unlikely in the near future as the problem has been shown to generalize the k-means clustering problem which is known to be [[NP-complete]].<ref>{{Cite book