Disciplined convex programming:

(K1t(1)+K2t(2)+K3t(3)+K4t(4)+K5t(5)+K6t(6)) * x == f
is non-convex, as it involves multiplication of 2 CVX variables, t and x.