Advantages of convex optimization than evaluationary algorithms

hello. i has a question about convex optimization advantages than evaluationary algorithms such as PSO, …
please help me.
thanks a lot.

This is off-topic for this forum.

But if you have a convex optimization problem, you’re generally best off using a solver which takes advantage of it, as do the solvers used by CVX, or will at least systematically find a local optimum, which would thus be a global optimum. If you have a non-convex problem and want to roll the dice with heuristic algorithms such as PSO, ACO or whatever (not my favorite algorithms), you are free to do so.