Consider:
\begin{equation}\min_{x, y} \max_{\omega} | f(x, y, \omega) |\end{equation}
where $(x , y)\in \mathbb{R}\times \mathbb{R} $ and $\omega \in (0, \infty)$.
$f$ is the result of dividing two polynomials. In exact details we have :
\begin{equation} f = \frac{cz+d}{z^m(z^2+az+b)+cz+d} \end{equation}
where $ z = e^{j\omega} $. $a , b, m$ are constant numbers and $c,d$ depend on $x, y$
The optimization process begin with initial condition $(x_0, y_0)$, and the aim is to get optimal value in least iteration in the neighbor of $(x_0, y_0)$ with radius $r$.
What is suitable algorithm for this MiniMax (MiMa) problem?
