Polynomial-time computation of the ν robustness measure
Statement
Let denote the paper's robustness measure for systems with structured uncertainties, and let arbitrary precision mean that the computed value can be made to have any prescribed accuracy.
Polynomial-time computation conjecture. There exists a polynomial-time algorithm to compute within arbitrary precision.
Such an algorithm would make the proposed robustness measure computationally tractable for large-scale systems and complement the distributed methods developed for its convex upper bound. The source states this as a concluding research conjecture and supplies no algorithm or proof establishing it.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.