نتایج جستجو برای: generalized n set convex function

تعداد نتایج: 2717715  

Journal: :Discrete and Computational Geometry 2003

2008
Valentin V. Gorokhovik

The paper deals with affine selections of affine (both convex and concave) multifunctions acting between finite-dimensional real normed spaces. It is proved that each affine multifunction with compact values possesses an exhaustive family of affine selections and, consequently, can be represented by its affine selections. Moreover, a convex multifunction with compact values possesses an exhaust...

2003
J. M. BORWEIN J. R. GILES

The modification of the Clarke generalized subdiNerentia1 due to Michel and Penot is a useful tool in determining differentiability properties for certain classes of real functions on a normed linear space. The Glteaux differentiability of any real function can be deduced from the GBteaux differentiability of the norm if the function has a directional derivative which attains a constant related...

2015
Giulianella Coletti Davide Petturiti Barbara Vantaggi

We deal with decisions under risk starting from a partial preference relation on a finite set of generalized convex lotteries, that are random quantities equipped with a convex capacity. A necessary and sufficient condition (Choquet rationality) is provided for its representability as a Choquet expected utility of a strictly increasing utility function. The restriction to concave utility functi...

Journal: :J. Applied Mathematics 2012
Hehua Jiao Sanyang Liu Xinying Pai

A kind of generalized convex set, called as local star-shaped E-invex set with respect to η, is presented, and some of its important characterizations are derived. Based on this concept, a new class of functions, named as semilocal E-preinvex functions, which is a generalization of semi-Epreinvex functions and semilocal E-convex functions, is introduced. Simultaneously, some of its basic proper...

Journal: :European Journal of Operational Research 1999
Jesús Mario Bilbao Esperanza A. Lebrón N. Jiménez

A game on a convex geometry is a real-valued function de®ned on the family L of the closed sets of a closure operator which satis®es the ®nite Minkowski±Krein±Milman property. If L is the Boolean algebra 2 N then we obtain a n-person cooperative game. We will introduce convex and quasi-convex games on convex geometries and we will study some properties of the core and the Weber set of these games.

Journal: :SIAM Journal on Optimization 1995
Jay S. Treiman

A Lagrange multiplierrules that uses small generalized gradients is introduced. It includes both inequality and set constraints. The generalized gradient is the linear generalized gradient. It is smaller than the generalized gradients of Clarke and Mordukhovich but retains much of their nice calculus. Its convex hull is the generalized gradient of Michel and Penot if a function is Lipschitz. Th...

2016
DARYL COOPER DARREN LONG STEPHAN TILLMANN

We study a properly convex real projective manifold with (possibly empty) compact, strictly convex boundary, and which consists of a compact part plus finitely many convex ends. We extend a theorem of Koszul which asserts that for a compact manifold without boundary the holonomies of properly convex structures form an open subset of the representation variety. We also give a relative version fo...

Journal: :J. Global Optimization 2010
Satoshi Suzuki

Dual characterizations of the containment of a convex set, defined by infinite quasiconvex constraints, in an evenly convex set, and in a reverse convex set, defined by infinite quasiconvex constraints, are provided. Notions of quasiconjugate for quasiconvex functions, λ-quasiconjugate and λsemiconjugate, play important roles to derive the characterizations of the set containments.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید