Pages that link to "Item:Q672439"
From MaRDI portal
The following pages link to A linear programming algorithm for invariant polyhedral sets of discrete-time linear systems (Q672439):
Displaying 12 items.
- Positive invariance, monotonicity and comparison of nonlinear systems (Q662000) (← links)
- Convex invariant sets for discrete-time Lur'e systems (Q1023380) (← links)
- Constrained regulation of continuous Petri nets (Q1036660) (← links)
- \((A,B)\)-invariant polyhedral sets of linear discrete-time systems (Q1964708) (← links)
- Squaring the circle: an algorithm for generating polyhedral invariant sets from ellipsoidal ones (Q2477710) (← links)
- Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints (Q2663960) (← links)
- Positively invariant polyhedral sets of discrete-time linear systems (Q3791043) (← links)
- Invariant polytopes of linear systems (Q4223712) (← links)
- Constrained predictive control of linear distributed parameter systems (Q4651187) (← links)
- Exploring positively invariant sets by linear systems over idempotent semirings (Q4818200) (← links)
- (Q5446614) (← links)
- Dual optimization approach to set invariance conditions for discrete-time dynamic systems (Q6088553) (← links)
