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.

https://twitter.com/themarklstone/status/1586795881168265216

Don’t apply crude, unsafeguarded (no Trust Region or Line Search) Successive Convex Approximation (SCA) to a new problem … unless your name happens to be Stephen Boyd.

There’s a reason high quality non-convex nonlinear optimization solvers are more than 10 lines long.

Need Help on quad_over_lin
SOS! I used SCA to optimize the variables Psi_hat, but it seemed that the value of the optimization barely changed each time and there is no upward trend
NaN——Status: Infeasible Optimal value (cvx-optval): - Inf
Optimal value is NaN, after 3th iteration of CVX
The reason of causing 'NaN' value in CVX feasibility solve
Why is there an error in reproducing this alternate optimization implemented using the SCA algorithm and penalty function?
HELP! Why the status of the first status is often Unbounded
What’s the possible reason for my Failed status?
How to use CVX solving optimization problem with coordinate desent algorithm?
The result of CVX solver is not the best point
Can this SINR problem be solved by CVX?
CVX status: solved, but the result doesn't satisfy the constraint
May I ask why the optimal solution obtained when solving this problem with the SCA algorithm does not satisfy this inequality constraint?
I am trying to solve Joint optimization problem with the CVX toolbox and second sub problem becomes concave + Convex as the sub problem gives negative powers (Even if I specify nonnegative ). Then program stops running . Please help me in this regardng
CVX: Ineffectiveness of restraints!
Question on BCD in cvx
How should I write the following positive semidefinite constraint in cvx?
Although the status shows field but it can solve for the correct value and there is a slight drop in the output value when convergence is near, what are the reasons for these problems and how can they be solved?
What if the iteration graph does not converge?
How can i represent x^1.15 in cvx
Problem with geometric programming
SCA method. How to solve the problem with Matlab CVX?
Help. Is there any tips for choosing the initial point of the SCA
Using SCA and CVX does not converge
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;"
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;"
Can anyone help with Scaling issue(maybe
Disciplined convex programming error: Invalid numeric values (NaNs) may not be used in CVX expressions.
Help! CVX iteratively solves the Taylor series expansion points