My task involves minimizing sum(a + b) subject to the equality constraints a = v^2 and b = 3*v^3. What manipulations should I be doing so that I can represent both a & b as linear equality constraints?
Manipulation for converting equality constrains from nonlinear to linear
minimize(v^2+3*v^3)
Equality constraints are not allowed in CVX with nonlinear expressions.
If the above formulation does not suit your needs, then perhaps your problem is not convex?