7 problems

Polynomial-time computation conjecture. There exists a polynomial-time algorithm to compute $\nu$ within arbitrary precision.

Let $\mathcal{C}_n$ be the space of full-order dynamic policies for $\mathcal{H}_\infty$ control. A policy $\mathsf{K}\in\mathcal{C}_n$ is Clarke stationary when…

Let $\mathcal{C}_n$ be the space of full-order dynamic policies, and let $\mathcal{C}_{\mathrm{nd}}$ be the subset of non-degenerate policies, namely those admitting a certificate…

Let $M\in\mathbb{Z}^{+}$ and let … Suppose that the switched system under consideration is robust feedback stabilizable. Non-conservatism conjecture. There exists an…

Balancing-algorithm conjecture. Algorithm always converges. Moreover, the number of iterations required to reach a given tolerance is $O(\log(n))$ for fixed $\epsilon$, and…

Exactness conjecture. $\overline{\nu}$ is exact for some class of norm-bounded disturbances.

Convex upper-bound conjecture. For positive systems, there exists a convex upper bound for a robustness measure against such uncertainties.