Thank you very much for your response. In my optimization problem, which is an exercise for my university, it has been said that we want to find m circles A_i = { x : ||x-c||_2 <= r } , i=1,..,m , with their centers and radiuses to minimize total areas and there are two constraints:

The first constraint is that the first n circles are constant, i.e. , c_i = cfix_i , r_i = rfix_i for i=1,..,n .

**[Edited] : I just contact the Teacher Assistant about it, and they said they had a mistake in typing the question! The correct one is like this:**

And the second constraint is A_i \cap A_j = Ø , i,j \in S (the set S is defined as some i’s and j’s). And It also says that some of the circles may be just a single point c (i.e. , r=0).

So now it is about to “not” have any overlap for some circles. Still I don’t know how to write that in cvx.

(Sorry for my English btw it’s not my mother language.)