How to sovle this QP problem in cvx?

clc
clear
viewNum = 3;
lamda = 100;
u = 1/viewNum*ones(1,viewNum);
ker = cell(1,viewNum);
ker{1} = rand(6,6);
ker{2} = rand(6,6);
ker{3} = rand(6,6);
idealKer = [1 1 0 0 0 0; 1 1 0 0 0 0; 0 0 1 1 0 0; 0 0 1 1 0 0; 0 0 0 0 1 1; 0 0 0 0 1 1];
cvx_begin
    variable u(1,viewNum)
    minimize( square_pos(norm(u(1).*ker{1}+u(2).*ker{2}+u(3).*ker{3} - idealKer,'fro')) +  lamda*square_pos(norm( u ,2)))
    subject to
        u >= 0
        u*ones(viewNum,1) == 1
cvx_end

I do not known, whether it is right?