I am a beginner for CVX and I am trying to solve the below problems, however, I get a wrong message of " Cannot perform the operation norm( {mixed convex/constant}, 2 ),出错 UAV (第 196 行) s1_2=norm([1,x])-x;"

[wyy1]

@The result obtained using the SeDuMi solver is inaccurate. The optimal solution is not as good as before the optimization.

Unsafeguarded (no line search or trust region)Successive Convex Approximation (SCA) or generally, alternating variables optimization are unreliable. It might not descend (for minimization problem), i.e., iterates could get worse. It might not converge to anything; and if it does converge, it might not be to a local optimum of the original problem, let alone a global optimum. The solution of successive iterations, and therefore subproblem inputs, can become wilder and wilder, until at some point the solver fails, or makes erroneous determination of infeasibility or unboundedness.

I am currently trying to use Successive Convex Approximation (SCA) to transform the non-convex objective function into a convex one, and then use CVX to solve the minimization problem. The Extended Kalman Filter (EKF) is only used for tracking afterwards and is not involved in the CVX solving process. However, during the SCA iteration, the optimal solution keeps increasing as the number of iterations increases. What should I do now