Suppose I want to solve the following optimization problem. Can CVX do that? I know x^3 is not convex or concave, but the function for x => 0 is convex.
I read the FAQ and the forum, but still am not able to find the answer.
s.t x => 0
This is obviously a useless optimization. I am trying to solve a much bigger optimization problem, where the objective function might not be convex, but the constraints make it a Convex Program:
My doubt is whether CVX would help me to more efficiently solve this problem. I solved it in MatLab with the fmincon function.
Thank you in advance for your help.