Metraipolis › archive › dc_d2388cd59282

Antagonistic Control: Foundations, Scalability and Nonlinearity — arXiv:2608.22204

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.22204
License (as archived)
CC0-1.0
Archived
2026-10-18T08:25:34.792Z
SHA-256 of the archived text
bd92f9cd0cd94baf3a5f4e05be1f4b14c315bf43e9e1c0ddd7225f334db812bc
Stable URL of this page
https://metraipolis.com/documento/dc_d2388cd59282

How to cite

Antagonistic Control: Foundations, Scalability and Nonlinearity — arXiv:2608.22204 — arXiv (en), https://arxiv.org/abs/2608.22204 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d2388cd59282 (Metraipolis archive dc_d2388cd59282, sha256 bd92f9cd0cd94baf3a5f4e05be1f4b14c315bf43e9e1c0ddd7225f334db812bc)
BibTeX
@misc{dcd2388cd59282,
  title = {Antagonistic Control: Foundations, Scalability and Nonlinearity — arXiv:2608.22204},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.22204},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d2388cd59282; sha256 bd92f9cd0cd94baf3a5f4e05be1f4b14c315bf43e9e1c0ddd7225f334db812bc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22204. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper studies the worst-case impact of constrained control inputs: an input seeks to maximize the average cost of some outputs, measured in the $L_2$ or $L_1$ norm, while remaining bounded in terms of other outputs. This problem template subsumes classical metrics such as the $H_\infty$ norm and the output-to-output gain, and arises in adversarial control, security assessment, and robust control. For linear time-invariant systems, we provide an exact semi-definite program (SDP) when there is a single constraint, and SDPs computing upper bounds when there are multiple constraints. We derive sufficient conditions, in terms of system zeros and relative degrees, under which the worst-case cost is unbounded, together with a constructive closed-loop modification that removes the unboundedness. From a security standpoint, unbounded values reveal structural limitations in detecting certain attack inputs. For positive systems, we provide scalable formulations whose complexity grows linearly in the state dimension: a scalable SDP for quadratic costs, and an exact linear program for linear costs. The results extend to nonlinear polynomial systems via a sum-of-squares program. We illustrate the results with numerical examples.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.OC).
Categorie arXiv: Optimization and Control (math.OC) ; Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2608.22204 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T08:18:05.689Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).