Optimization of the reachable set of a linear system with respect to another set
From MaRDI portal
Publication:6167989
DOI10.1134/s0965542523050056zbMath1527.49017OpenAlexW4382052754MaRDI QIDQ6167989
Maxim V. Balashov, Unnamed Author
Publication date: 10 July 2023
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542523050056
linear programminguniform convexityreachable setmultivalued integralapproximation in Hausdorff metriccondition of nonempty interior
Linear programming (90C05) Attainable sets, reachability (93B03) Optimality conditions for problems involving ordinary differential equations (49K15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large deviations for non-zero initial conditions in linear systems
- Dynamics and control of trajectory tubes. Theory and computation
- On polyhedral approximations in an \(n\)-dimensional space
- Polyhedral approximations of strictly convex compacta
- Reachability analysis of linear systems using support functions
- Geometry of Banach spaces. Selected topics
- Convexity properties of the minimum time function
- Covering a set by a convex compactum: error estimates and computation
- Integrals of set-valued functions
- Strongly convex analysis
- A Survey of Viability Theory
- Gradient Theory of Optimal Flight Paths
- A Steepest-Ascent Method for Solving Optimum Programming Problems
- $ M$-strongly convex subsets and their generating sets
- Overapproximating Reachable Tubes of Linear Time-Varying Systems
- Strong convexity of reachable sets of linear systems
This page was built for publication: Optimization of the reachable set of a linear system with respect to another set