Approximation of convex bodies by multiple objective optimization and an application in reachable sets
From MaRDI portal
(Redirected from Publication:5745164)
Recommendations
- An approximation algorithm for convex multi-objective programming problems
- scientific article; zbMATH DE number 1830716
- Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones
- Approximation in multiobjective optimization
- Approximation methods for multiobjective and parametric optimization problems
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Approximation methods in multiobjective programming
- On approximate solutions in multiobjective optimization
- Covers and approximations in multiobjective optimization
- Optimizing over the properly efficient set of convex multi-objective optimization problems
Cites work
- 10.1007/s11470-008-3005-z
- An approximation algorithm for convex multi-objective programming problems
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Approximation of reachable sets by direct solution methods for optimal control problems
- Approximation of reachable sets using optimal control algorithms
- Differential equations for ellipsoidal estimates for reachable sets of a nonlinear dynamical control system
- Ellipsoidal techniques for reachability analysis: Internal approximation
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- Error estimates for discretized differential inclusions
- scientific article; zbMATH DE number 4216876 (Why is no real title available?)
- Hybrid Systems: Computation and Control
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Nonlinear multiobjective optimization
- On Ellipsoidal Techniques for Reachability Analysis. Part I: External Approximations
- Polygonal approximation of plane convex bodies
- Polyhedral approximation of convex compact bodies by filling methods
- Primal and dual approximation algorithms for convex vector optimization problems
- Some lower bounds on sparse outer approximations of polytopes
- The modified method of refined bounds for polyhedral approximation of convex polytopes
- Uniform estimation of a convex body by a fixed-radius ball
Cited in
(6)- Convex projection and convex multi-objective optimization
- Computing Convex Coverage Sets for Faster Multi-objective Coordination
- A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
- Towards optimal space-time discretization for reachable sets of nonlinear control systems
- Computing the recession cone of a convex upper image via convex projection
- Approximations of unbounded convex projections and unbounded convex sets
This page was built for publication: Approximation of convex bodies by multiple objective optimization and an application in reachable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745164)
