f1 is concave, so this term can be handled as is by CVX. -f2 is convex, so must be “convexified” in the DC algorithm.
See my answers at Can CVX solve the difference of convex functions (D.C.) problems? .
f1 is concave, so this term can be handled as is by CVX. -f2 is convex, so must be “convexified” in the DC algorithm.
See my answers at Can CVX solve the difference of convex functions (D.C.) problems? .