ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ν\nu 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 ν\nu 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.