Metraipolis › archive › dc_5d9035efcf6f

The Maximal Robust Positively Invariant Set for Linear Difference Inclusions — arXiv:2609.39499

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39499
License (as archived)
CC0-1.0
Archived
2026-10-07T14:11:25.909Z
SHA-256 of the archived text
86b50921dd58f34daf429204844fe2e6751ac23c00e77cb7a4702c399c2bb7bc
Stable URL of this page
https://metraipolis.com/documento/dc_5d9035efcf6f

How to cite

The Maximal Robust Positively Invariant Set for Linear Difference Inclusions — arXiv:2609.39499 — arXiv (en), https://arxiv.org/abs/2609.39499 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5d9035efcf6f (Metraipolis archive dc_5d9035efcf6f, sha256 86b50921dd58f34daf429204844fe2e6751ac23c00e77cb7a4702c399c2bb7bc)
BibTeX
@misc{dc5d9035efcf6f,
  title = {The Maximal Robust Positively Invariant Set for Linear Difference Inclusions — arXiv:2609.39499},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39499},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5d9035efcf6f; sha256 86b50921dd58f34daf429204844fe2e6751ac23c00e77cb7a4702c399c2bb7bc},
  year = {2026}
}

Archived text

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

This article develops a systematic characterization and exact computational framework for the maximal robust positively invariant set of linear difference inclusions subject to hard state constraints. The set is characterized as the greatest fixed point of the robust predecessor operator, leading to three equivalent decreasing set iterations---the standard, self-restricted, and incremental iterations---and exact stopping tests. Under uniform exponential stability of the matrix family and bounded disturbances, the limiting disturbance-reachable set is characterized and used to derive conditions for nonemptiness and finite determination. When the state constraint set is polyhedral, the three iterations admit exact half-space implementations for bounded disturbances and finite or polytopic matrix families. Although these implementations generate the same set sequence, they distribute computational effort differently. The complexity analysis and numerical study make these differences explicit and reveal how the underlying problem structure informs the choice of implementation.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.39499 — 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-07T14:03:18.264Z dalla pagina https://arxiv.org/catchup/math.OC/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).