I have a L_1 minimization problem where I’m given the following matrices: X(n,m) V(n,m).

```
cvx_solver sdpt3
cvx_begin quiet
cvx_solver sdpt3
cvx_begin quiet
variable A(n,n);
minimize (norm(A,1));
subject to
A*X==V;
cvx_end
```

When I run the above code the program doesn’t display any error however the “cvx_status” is Infeasible.

Any idea why this problem is infeasible in cvx.

Many thanks.