arXiv (All)
open access
The Maximal Robust Positively Invariant Set for Linear Difference Inclusions
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Lyapunov Constructions for System Interconnections Arising from Adaptation in Some Optimization Methods#625400
- Lyapunov Constructions for System Interconnections Arising from Adaptation in Some Optimization Methods#623127
- A Robust Perceptron Cycling Theorem and Applications#1012530
- Differential Inclusions for Gradient and Symmetrized Gradient Operators#1122939
- Approximation in reflexive Banach spaces and applications to the invariant subspace problem#1025966
Record · ID 1144466
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive