Math Is Fun Forum

onako

Member

Registered: 2010-03-28

Posts: 43

One optimization to facilitate another

Suppose matrices C \in R^{nxk} and X \in R^{nxk} are given, and  it is known that X minimizes the expression

which is the summation of squared differences over all nxn entries.
Can it be proved that such solution X minimizes

Perhaps writing the above in terms of sums could help.

Last edited by onako (2012-01-31 21:52:26)