arXiv (All)
open access
Computational complexity of static output feedback stabilization
We study the computational complexity of static output feedback (SOF) stabilization for continuous-time linear systems. For rational plant data, we prove that this problem is complete for the existential theory of the reals: it is equivalent, under polynomial-time transformations, to deciding whethe
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
- From detectability of abstract linear systems to exponential output-to-state stability and back#1130382
- Characterizing Identifiability and Generalization for Inverse Receding-Horizon Linear-Quadratic Regulator Problems#1083530
- Sample Complexity of Linear Quadratic Regulator Without Initial Stability#821684
- On robust stability of delayed Lienard systems#643260
- Elementwise Positivity of the Solution to Lyapunov Equation for Hurwitz Companion Matrices#999350
Record · ID 1155325
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