pointed convex cone
Recently Published Documents


TOTAL DOCUMENTS

2
(FIVE YEARS 2)

H-INDEX

0
(FIVE YEARS 0)

Author(s):  
Karl-Hermann Neeb ◽  
Daniel Oeh

AbstractIn this note, we study in a finite dimensional Lie algebra $${\mathfrak g}$$ g the set of all those elements x for which the closed convex hull of the adjoint orbit contains no affine lines; this contains in particular elements whose adjoint orbits generates a pointed convex cone $$C_x$$ C x . Assuming that $${\mathfrak g}$$ g is admissible, i.e., contains a generating invariant convex subset not containing affine lines, we obtain a natural characterization of such elements, also for non-reductive Lie algebras. Motivated by the concept of standard (Borchers) pairs in QFT, we also study pairs (x, h) of Lie algebra elements satisfying $$[h,x]=x$$ [ h , x ] = x for which $$C_x$$ C x pointed. Given x, we show that such elements h can be constructed in such a way that $$\mathop {\mathrm{ad}}\nolimits h$$ ad h defines a 5-grading, and characterize the cases where we even get a 3-grading.


Author(s):  
Christian Günther ◽  
Bahareh Khazayel ◽  
Christiane Tammer

AbstractIn vector optimization, it is of increasing interest to study problems where the image space (a real linear space) is preordered by a not necessarily solid (and not necessarily pointed) convex cone. It is well-known that there are many examples where the ordering cone of the image space has an empty (topological/algebraic) interior, for instance in optimal control, approximation theory, duality theory. Our aim is to consider Pareto-type solution concepts for such vector optimization problems based on the intrinsic core notion (a well-known generalized interiority notion). We propose a new Henig-type proper efficiency concept based on generalized dilating cones which are relatively solid (i.e., their intrinsic cores are nonempty). Using linear functionals from the dual cone of the ordering cone, we are able to characterize the sets of (weakly, properly) efficient solutions under certain generalized convexity assumptions. Toward this end, we employ separation theorems that are working in the considered setting.


Sign in / Sign up

Export Citation Format

Share Document