I have to solve the following optimisation problem in R Mosek:
This is a convex constraint which can be transformed into the intersection of 2^N-1
cone constraints and one half space:
This is unfeasible in my actual case because N=50
. What can I do? Is it my problem impossible to be solved (with R Mosek)?
Edit following the answer:
Is it my constraint
equivalent to