Nonnegative matrix factorization
From Wikimization
(Difference between revisions)
| Line 2: | Line 2: | ||
Given rank-2 nonnegative matrix | Given rank-2 nonnegative matrix | ||
| - | <math>X=\!\left[\!\begin{array}{ccc}17&28&42\\ | + | <math>X=\!\left[\!\begin{array}{ccc}\textbf{17}&28&42\\ |
16&47&51\\ | 16&47&51\\ | ||
17&82&72 | 17&82&72 | ||
Current revision
Exercise from Convex Optimization & Euclidean Distance Geometry, ch.4:
Given rank-2 nonnegative matrix
find a nonnegative factorization
by solving
which follows from the fact, at optimality,
Use the known closed-form solution for a direction vector to regulate rank (rank constraint is replaced) by Convex Iteration;
set to a nonincreasingly ordered diagonalization and
,
then
In summary, initialize then alternate solution of
with
Global convergence occurs, in this example, in only a few iterations.