Motzkin decomposition of closed convex sets
DOI10.1016/J.JMAA.2009.10.015zbMATH Open1188.90195OpenAlexW2090226889WikidataQ57836348 ScholiaQ57836348MaRDI QIDQ847066FDOQ847066
Authors: N. E. Zubov 
Publication date: 12 February 2010
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2009.10.015
Recommendations
convex setsconvex conesMotzkin decompositionlinear representationpolyhedral setsconic representation
Convex programming (90C25) Linear programming (90C05) (n)-dimensional polytopes (52B11) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal structure of convex sets. II
- Linear semi-infinite optimization: recent advances
- Convex analysis and nonlinear optimization. Theory and examples.
- Recent contributions to linear semi-infinite optimization
- Title not available (Why is that?)
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Dual characterizations of set containments with strict convex inequalities
- Title not available (Why is that?)
- Representability of convex sets by analytical linear inequality systems.
- The indirect function of an NTU game
- On the characterization of some families of closed convex sets
- Title not available (Why is that?)
- Excess information in parametric linear optimization
- Title not available (Why is that?)
Cited In (36)
- Closed convex sets that are both Motzkin decomposable and generalized Minkowski sets
- A Doob-Meyer decomposition under model ambiguity: the case of compactness
- A relaxation method for solving systems with infinitely many linear inequalities
- A subdifferential characterization of Motzkin decomposable functions
- Maximal quadratic-free sets
- Maximal quadratic-free sets
- Title not available (Why is that?)
- Closed convex sets with an open or closed Gauss range
- The Voronoi inverse mapping
- On M-predecomposable sets
- Selected applications of linear semi-infinite systems theory
- Closed convex sets of Minkowski type
- Penumbras and separation of convex sets
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
- Minkowski summands of cubes
- On OM-decomposable sets
- On the Gauss range of a closed convex set
- Projections and generated cones of homothetic convex sets
- Motzkin predecomposable sets
- On M-decomposable sets
- Comments on: Stability in linear optimization and related topics. A personal tour
- Strong approachability
- Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality
- Voronoi cells via linear inequality systems
- Weakly Motzkin predecomposable sets
- On Motzkin decomposable sets and functions
- Support and separation properties of convex sets in finite dimension
- Structural Stability of the Financial Market Model: Continuity of Superhedging Price and Model Approximation
- Recent contributions to linear semi-infinite optimization
- Classes of homothetic convex sets
- Title not available (Why is that?)
- Strong duality and sensitivity analysis in semi-infinite linear programming
- On the stability of the Motzkin representation of closed convex sets
- Characterization of tropical hemispaces by \((P, R)\)-decompositions
- Motzkin decomposition of closed convex sets via truncation
- Recent contributions to linear semi-infinite optimization: an update
This page was built for publication: Motzkin decomposition of closed convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847066)
