Optimization of the reachable set of a linear system with respect to another set
DOI10.1134/S0965542523050056zbMATH Open1527.49017OpenAlexW4382052754MaRDI QIDQ6167989FDOQ6167989
Authors: Maxim V. Balashov 
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 programmingreachable setuniform convexitymultivalued integralapproximation in Hausdorff metriccondition of nonempty interior
Linear programming (90C05) Optimality conditions for problems involving ordinary differential equations (49K15) Attainable sets, reachability (93B03)
Cites Work
- Geometry of Banach spaces. Selected topics
- Convexity properties of the minimum time function
- Title not available (Why is that?)
- Reachability analysis of linear systems using support functions
- Strongly convex analysis
- Elements of convex and strongly convex analysis
- Dynamics and control of trajectory tubes. Theory and computation
- $ M$-strongly convex subsets and their generating sets
- Title not available (Why is that?)
- Integrals of set-valued functions
- Title not available (Why is that?)
- Covering a set by a convex compactum: error estimates and computation
- Large deviations for non-zero initial conditions in linear systems
- A Survey of Viability Theory
- Gradient Theory of Optimal Flight Paths
- A Steepest-Ascent Method for Solving Optimum Programming Problems
- On polyhedral approximations in an \(n\)-dimensional space
- Polyhedral approximations of strictly convex compacta
- Title not available (Why is that?)
- Overapproximating Reachable Tubes of Linear Time-Varying Systems
- Strong convexity of reachable sets of linear systems
Cited In (3)
This page was built for publication: Optimization of the reachable set of a linear system with respect to another set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167989)
