A general cone decomposition theory based on efficiency

DOI10.1007/BF01581687zbMath0819.46002WikidataQ57836419 ScholiaQ57836419MaRDI QIDQ1334950

Alberto Seeger, Juan-Enrique Martinez-Legaz

Publication date: 26 September 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

convex conesMoreau decompositionpartially ordered vector spacesefficient decompositiongeneral cone decomposition theorymeasure for the quality of a decomposition

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Convex sets in topological linear spaces; Choquet theory (46A55) Ordered topological linear spaces, vector lattices (46A40)

Related Items

Uniform convexity and the splitting problem for selections, Convex sections of rectangular sets and splitting of selections, Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function

Cites Work

• An existence result for maximizations with respect to cones
• On functions representable as a difference of convex functions
• Extension of linear-quadratic control, optimization and matrix theory
• Compact, convex sets inRⁿand a new banach lattice. I.- Theory.
• Existence and characterization of efficient decisions with respect to cones
• Projection on a Cone, Penalty Functionals and Duality Theory for Problems with Inequaltity Constraints in Hilbert Space
• An Existence Theorem in Vector Optimization
• On the Existence of Pareto Efficient Points
• Functions Representable as Differences of Subharmonic Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item