It could work in one dimension if you had enough control over the ranges and signs of different expressions to be able to omit the norm, but it is not convex in full generality without such restrictions.

If q,v are to be higher-dimensional then it looks completely nonconvex.

thank you so much,I figure out a new code,but I don’t know it is rigth or false.
I use: pos(2*(qF-qI) * inv_pos(t)-2 * VI)<=yita
instead of: norm(2*(qF-qI) * inv_pos(t)-2VI,1)<=yita
Is it right?
Thank you again.

Your constraint is non-convex. Your attempts at convex alchemy are doomed to failure. If you find a formulation CVX accepts, that means it does not correctly implement the constraint. If you “correctly” formulate in a way which would be correct other than violating CVX’s DCP rules, then it will violate CVX’s DCP rules.