Motzkin decomposition of closed convex sets via truncation
From MaRDI portal
Publication:1936203
DOI10.1016/j.jmaa.2012.10.072zbMath1262.52002OpenAlexW1966006482WikidataQ57836308 ScholiaQ57836308MaRDI QIDQ1936203
Juan-Enrique Martinez-Legaz, Alfredo Noel Iusem, Maxim Ivanov Todorov, Miguel Angel Goberna
Publication date: 21 February 2013
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/35903
Convex programming (90C25) Linear programming (90C05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
Minimization of semicoercive functions: a generalization of Fichera's existence theorem for the Signorini problem, Weakly Motzkin predecomposable sets, Recent contributions to linear semi-infinite optimization, On the stability of the Motzkin representation of closed convex sets, Motzkin predecomposable sets, Recent contributions to linear semi-infinite optimization: an update, On the quadratic eigenvalue complementarity problem over a general convex cone, Preface, On OM-decomposable sets, On M-predecomposable sets, On M-decomposable sets, A subdifferential characterization of Motzkin decomposable functions
