If you have Mosek available as solver, use that, becasue it it the most (numer8ically) robust solver and provides the best warning and diagnostic information. Otherwise try SeDuMi. I predict Mosek will give a warning about large magnitude numbers, which are likely making the solution of your problem unrelaible.
If after fixing the problem scaling, the problem is still reported to be unbounded, please read https://yalmip.github.io/debuggingunbounded/ , which, other than some syntax differences, applies to CVX as well as to YALMIP.
Regarding “The command window shows as follows SDPT3: Infeasible path-following algorithms.” Don’t worry about it. That is just a generic description of SDPT3’s algorithm. It says nothing about what happened when SDPT3 was invoked to solve the problem CVX provided it.