Numerical Computation for Demyanov Difference of Polyhedral Convex Sets
نویسندگان
چکیده
Under the assumption of polyhedron, the Demyanov difference of convex compact sets is computed via some linear programmings by C procedure. The difference from the existing results is also compared, and some examples with the corresponding numerical results are given.
منابع مشابه
An Algorithm for the Computation of Polyhedral Invariant Sets for Closed-Loop Linear MPC Systems
Given an asymptotically stabilizing linear MPC controller, this paper proposes an algorithm to construct invariant polyhedral sets for the closed-loop system. The approach exploits a recently developed DC (Difference of Convex functions) programming technique developed by the authors to construct a polyhedral set in between two convex sets. Here, the inner convex set is any given level set V (x...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملA new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a given regular lattice. For this purpose, a polyhedral approximation is used to reconstruct their boundary structure. In the planar case d = 2, the performance and precision of the algorithm is studied on various examples ...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملNote on Prime Representations of Convex Polyhedral Sets
Consider a convex polyhedral set represented by a system of linear inequalities. A prime representation of the polyhedron is one that contains no redundant constraints. We present a sharp upper bound on the difference between the cardinalities of any two primes.
متن کامل