MATLAB: Minimization problem – matrix frobenius norm

frobenius normoptimization

Hey there, i am working on homework and i need to implement an algorithm from a paper. in the final stage, i have to smooth a matrix which represents movment of camera, (9xnumber of frames). this is done by fitting a 3 dim polynomial model, so if E is the camera matrix, i have to solve:
min ||C*E-C*K*B||
where K is 9*dim coeff matrix, and B is just the variable meshgridded: [1, 1^2, 1^3; 2 2^2 2^3;3 3^2 3^3] etc.
the norm is Frobenius norm. how can i solve this in matlab? i tried lsqnolin, it's working, but taking LONG time, and easily reaches memory limit with more than 400 frames.
Thanks

Best Answer

So, we're solving for K? Since there are no constraints, it is a purely linear least squares problem and an analytical solution is available,
K=C\(C*E)/B
If the matrix C is square, nonsingular, this of course reduces to
K=E/B