Pages that link to "Item:Q4649293"
From MaRDI portal
The following pages link to Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations (Q4649293):
Displaying 14 items.
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares (Q258393) (← links)
- Reachability computation for polynomial dynamical systems (Q526433) (← links)
- Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems (Q832032) (← links)
- Comments on ``Reachability of polynomial matrix descriptions (PMDs)'' by G. F. Fragulis and A. I. G. Vardulakis (Q1382939) (← links)
- Viability, viscosity, and storage functions in model-predictive control with terminal constraints (Q2665391) (← links)
- Counterexample-Guided Refinement of Template Polyhedra (Q3303915) (← links)
- Algorithms for exact and approximate linear abstractions of polynomial continuous systems (Q4561454) (← links)
- Backward Reachability for Polynomial Systems on a Finite Horizon (Q5033904) (← links)
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems (Q5232243) (← links)
- Solving Linear Systems with Polynomial Parameter Dependency with Application to the Verified Solution of Problems in Structural Mechanics (Q5244700) (← links)
- Polynomial Level-Set Method for Polynomial System Reachable Set Estimation (Q5353361) (← links)
- SOS-based solution approach to polynomial LPV system analysis and synthesis problems (Q5460618) (← links)
- A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems (Q6104921) (← links)
- Adaptive directions for Bernstein-based polynomial set evolution (Q6623019) (← links)
