On the stability of the Motzkin representation of closed convex sets
A nonempty set \(F\subset \mathbb R^n\) is called Motzkin decomposable when it can be expressed as the Minkowski sum of a~compact convex set with a~closed convex cone. The main objective of this paper is the study of the stability properties of the sum of a compact convex set with a closed convex cone when one of these two sets, or both, are subject to small perturbations. In particular, the continuity of the set-valued mapping associating to each couple \((C, D)\) formed by a compact convex set~\(C\) and a closed convex cone~\(D\) its Minkowski sum \(C + D\) is examined. This problem can be seen as a particular case of the following one: studying the stability of the feasible set for the different types of representations of closed convex sets. The stability of the feasible set mapping for Motzkin representations of those closed convex sets which are Motzkin decomposable is also studied.
- A Semi-Infinite Programming Model In Data Envelopment Analysis
- Continuous selections. I
- Convexity and well-posed problems
- scientific article; zbMATH DE number 3824568 (Why is no real title available?)
- scientific article; zbMATH DE number 3901504 (Why is no real title available?)
- scientific article; zbMATH DE number 490143 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1776908 (Why is no real title available?)
- scientific article; zbMATH DE number 3022422 (Why is no real title available?)
- Kuratowksi convergence of the efficient sets in the parametric linear vector semi-infinite optimization
- Lower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimization
- Motzkin decomposition of closed convex sets
- Motzkin decomposition of closed convex sets via truncation
- On Motzkin decomposable sets and functions
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- Stability of linear inequality systems measured by the Hausdorff metric
- Stability of nondominated solutions in multicriteria decision-making
- Stability theorems for infinitely constrained mathematical programs
- Stability Theory for Linear Inequality Systems
- Upper semicontinuity of the feasible set mapping for linear inequality systems
- Variational Analysis
- Weakly Motzkin predecomposable sets
- Motzkin decomposition of closed convex sets via truncation
- On M-predecomposable sets
- A subdifferential characterization of Motzkin decomposable functions
- Closed convex sets that are both Motzkin decomposable and generalized Minkowski sets
- Closed convex sets of Minkowski type
- Motzkin decomposition of closed convex sets
This page was built for publication: On the stability of the Motzkin representation of closed convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436679)
