I have a known Binary Matrix \bf A of size M\times N.

Let \bf B (also a binary matrix of the same size) be an optimization variable.

I want \bf B to be as close as possible. The difference between \bf A and \bf B should be minimal.

The following constraint is working and giving me the desired output. First I vectorize the matrices and use the following constraint.

```
norm (A(:)-B(:),1)<=4;
```

But the problem is that CVX is taking much longer time to give me the output.

How can I resolve this issue? Can I impose the constraint in different ways so that it is efficiently solved?