I want to maximize $||x-y||$ with $x$ and $y$ in $C$ where $C$ is the intersection of some discs. We assume the intersection is nonempty, and closed. I am thinking, how to formulate it as a semidefinite programmimg problem? Does anyone know how?



max length or size of a convex set
I hope that the word "disc" indicates that we work in 2-dimensional Euclidean space. 
Then an intersection of discs would be something like a polygon, just that the sides are not straight lines but arcs of a circle. It should be possible to save the intersection in some data structure. And then one can compute the maximum distance from each arc to each other arc and take the maximum value. 


To compute the maximum distance between to given Arcs $A\_1$ and $A\_2$ let $x\_i\in A\_i$ be two points such that $d(x\_1,x\_2)=\sup\{d(x,y)|x\in A\_1,y\in A\_2\}$. (Existence follows from compactness). If you take a unit speed parametrization $\gamma\_1,\gamma\_2$ of the arcs, and times $t\_i$ with $\gamma\_i(t\_i)=x\_i$. Assuming, that $x\_1$ is not the endpoint of the arc $A\_1$, then the function $\mathbb{R}\rightarrow \mathbb{R} \qquad t\mapsto d(\gamma\_1(t),x\_2)$ obtains a maximum at $t$, so its differential must be $0$ at $t\_1$. But this is just the scalar product of $\gamma'\_1(t\_1)$ and the gradient of $d(-,x\_2)$ at $\gamma(t)$, which can be seen as the direction of the line connecting $x\_1$ and $x\_2$. 


This should make it possible to compute the distance by looking at finitely many cases. (Both endpoints, one inner point, two inner points).


Hope I understood the question right. 


