Properly efficient and efficient solutions for vector maximization problems in euclidean space

Recently Benson proposed a definition for extending Geoffrion's concept of proper efficiency to the vector maximization problem in which the domination cone K is any nontrivial, closed convex cone. We give an equivalent definition of his notion of proper efficiency. Our definition, by means of perturbation of the cone K, seems to offer another justification of Benson's choice above Borwein's extension of Geoffrion's concept. Our result enables one to prove some other theorems concerning properly efficient and efficient points. Among these is a connectedness result.     

Monotone and cash-invariant convex functions and hulls

This paper provides some useful results for convex risk measures. In fact, we consider convex functions on a locally convex vector space E which are monotone with respect to the preference relation implied by some convex cone and invariant with respect to some numeraire (‘cash’). As a main result, for any function f, we find the greatest closed convex monotone and cash-invariant function majorized by f. We then apply our results to some well-known risk measures and problems arising in connection with insurance regulation.     

关于Henig真有效性

在局部凸空间中,获得了Henig真有效点的一些等价条件,讨论了Henig真有效点与Benson真有效点之间的关系.     

集值优化问题Benson真有效解的高阶Fritz John型最优性条件

本文讨论的是集值优化问题Benson真有效解的高阶Fritz John型最优性条件,利用Aubin和Fraukowska引入的高阶切集和凸集分离定理,在锥-似凸映射的假设条件下,获得了带广义不等式约束的集值优化问题Benson真有效解的高阶Fritz John型必要和充分性条件.     

Criteria for biholomorphic convex mappings on the unit ball in Hilbert spaces

In this paper, we give a necessary and sufficient condition that a locally biholomorphic mapping f on the unit ball B in a complex Hilbert space X is a biholomorphic convex mapping, which improves some results of Hamada and Kohr and solves the problem which is posed by Graham and Kohr. From this, we derive some sufficient conditions for biholomorphic convex mapping. We also introduce a linear operator in purpose to construct some concrete examples of biholomorphic convex mappings on B in Hilbert spaces. Moreover, we give some examples of biholomorphic convex mappings on B in Hilbert spaces.     

The semi-<Emphasis Type="Italic">E</Emphasis> cone convex set-valued map and its applications

In this paper, firstly, a new notion of the semi-E cone convex set-valued map is introduced in locally convex spaces. Secondly, without any convexity assumption, we investigate the existence conditions of the weakly efficient element of the set-valued optimization problem. Finally, under the assumption of the semi-E cone convexity of set-valued maps, we obtain that the local weakly efficient element of the set-valued optimization problem is the weakly efficient element. We also give some examples to illustrate our results.     

Algebraic signatures of convex and non-convex codes

A convex code is a binary code generated by the pattern of intersections of a collection of open convex sets in some Euclidean space. Convex codes are relevant to neuroscience as they arise from the activity of neurons that have convex receptive fields. In this paper, we develop algebraic methods to determine if a code is convex. Specifically, we use the neural ideal of a code, which is a generalization of the Stanley–Reisner ideal. Using the neural ideal together with its standard generating set, the canonical form, we provide algebraic signatures of certain families of codes that are non-convex. We connect these signatures to the precise conditions on the arrangement of sets that prevent the codes from being convex. Finally, we also provide algebraic signatures for some families of codes that are convex, including the class of intersection-complete codes. These results allow us to detect convexity and non-convexity in a variety of situations, and point to some interesting open questions.     

Approximating the nondominated set of an MOLP by approximately solving its dual problem

The geometric duality theory of Heyde and Löhne (2006) defines a dual to a multiple objective linear programme (MOLP). In objective space, the primal problem can be solved by Benson’s outer approximation method (Benson 1998a,b) while the dual problem can be solved by a dual variant of Benson’s algorithm (Ehrgott et al. 2007). Duality theory then assures that it is possible to find the (weakly) nondominated set of the primal MOLP by solving its dual. In this paper, we propose an algorithm to solve the dual MOLP approximately but within specified tolerance. This approximate solution set can be used to calculate an approximation of the weakly nondominated set of the primal. We show that this set is a weakly ε-nondominated set of the original primal MOLP and provide numerical evidence that this approach can be faster than solving the primal MOLP approximately.     

Duality Results for Generalized Vector Variational Inequalities with Set-Valued Maps

In this paper, we introduce new dual problems of generalized vector variational inequality problems with set-valued maps and we discuss a link between the solution sets of the primal and dual problems. The notion of solutions in each of these problems is introduced via the concepts of efficiency, weak efficiency or Benson proper efficiency in vector optimization. We provide also examples showing that some earlier duality results for vector variational inequality may not be true. This work was supported by the Brain Korea 21 Project in 2006.     

Higher order duality in vector optimization over cones

In this paper higher order cone convex, pseudo convex, strongly pseudo convex, and quasiconvex functions are introduced. Higher order sufficient optimality conditions are given for a weak minimum, minimum, strong minimum and Benson proper minimum solution of a vector optimization problem. A higher order dual is associated and weak and strong duality results are established under these new generalized convexity assumptions.     

Exterior Monge-Ampère solutions

We discuss the Siciak-Zaharjuta extremal function of a real convex body in Cn, a solution of the homogeneous complex Monge-Ampère equation on the exterior of the convex body. We determine several conditions under which a foliation by holomorphic curves can be found in the complement of the convex body along which the extremal function is harmonic. We study a variational problem for holomorphic disks in projective space passing through prescribed points at infinity. The extremal curves are all complex quadratic curves, and the geometry of such curves allows for the determination of the leaves of the foliation by simple geometric criteria. As a byproduct we encounter a new invariant of an exterior domain, the Robin indicatrix, which is in some cases the dual of the Kobayashi indicatrix for a bounded domain. Finally, we construct extremal curves for two non-convex bodies in R².     

On the boundedness, Christensen measurability and continuity of t-Wright convex functions

We discuss the connections between boundedness and continuity of t-Wright convex functions, moreover, we generalize some results of P. Fischer and Z. S?odkowski [4] concerning the Christensen measurability of Jensen convex functions to the case of t-Wright convex functions.     

Reduced convex bodies in Euclidean space—A survey

A convex body R in Euclidean space E^d is called reduced if the minimal width Δ(K) of each convex body K⊂R different from R is smaller than Δ(R). This definition yields a class of convex bodies which contains the class of complete sets, i.e., the family of bodies of constant width. Other obvious examples in E² are regular odd-gons. We know a relatively large amount on reduced convex bodies in E². Besides theorems which permit us to understand the shape of their boundaries, we have estimates of the diameter, perimeter and area. For d≥3 we do not even have tools which permit us to recognize what the boundary of R looks like. The class of reduced convex bodies has interesting applications. We present the current state of knowledge about reduced convex bodies in E^d, recall some striking related research problems, and put a few new questions.     

Fixed point theorems of ? convex −ψ concave mixed monotone operators and applications

In this paper, ? convex −ψ concave mixed monotone operators are introduced and some new existence and uniqueness theorems of fixed points for mixed monotone operators with such convexity concavity are obtained. As an application, we give one example to illustrate our results.     

集值均衡问题近似Benson真有效解的非线性刻画

在一般的数学模型中,由于要忽略一些次要因素,所建的模型往往是近似的,且对数学模型利用数值算法所求得的解大多是近似解。另一方面,在可行集非紧的情况下,精确解的解集往往是空集,而在较弱的条件下近似解集可以是非空的。在Hausdorff局部凸拓扑线性空间中分别研究了无约束和带约束集值均衡问题近似Benson真有效解。在没有任何凸性假设下,利用非线性泛函分别建立了最优性条件。     

The <Emphasis Type="Italic">(S)</Emphasis><Stack><Subscript>+</Subscript><Superscript>1</Superscript></Stack>Condition for Generalized Vector Variational Inequalities

In this paper, we extend the (S) ₊ ¹ condition to multivalued mappings in an ordered Hausdorff topological vector space and we derive some existence results for generalized vector variational inequalities associated with multivalued mappings satisfying the (S) ₊ ¹ condition. We generalize also an existence result of Cubiotti and Yao for generalized variational inequalities of class (S) ₊ ¹ to barreled normed spaces. As consequences, some existence results for vector variational inequalities are established.This work was partially supported by grants from the National Science Council of the Republic of China. Communicated by H. P. Benson     

Maximization of lower semi-continuous convex functional on bounded subsets of locally convex spaces. II: Quasi-Lagrangian duality theorems

We prove, for a proper lower semi-continuous convex functional ? on a locally convex space E and a bounded subset G of E, a formula for sup ?(G) which is symmetric to the Lagrange multiplier theorem for convex minimization, obtained in [7], with the difference that for sup ?(G) Lagrange multiplier functionals need not exist. When ? is also continuous we give some necessary conditions for g₀ ∈ G to satisfy ?(g₀) = sup ?(G). Also, we give some applications to deviations and farthest points. Finally, we show the connections with the “hyperplane theorems” of our previous paper [8].     

On the convolution and subordination of convex functions

In this work we present some new results on convolution and subordination in geometric function theory. We prove that the class of convex functions of order α is closed under convolution with a prestarlike function of the same order. Using this, we prove that subordination under the convex function order α is preserved under convolution with a prestarlike function of the same order. Moreover, we find a subordinating factor sequence for the class of convex functions. The work deals with several ideas and techniques used in geometric function theory, contained in the book Convolutions in Geometric Function Theory by Ruscheweyh (1982).     

Some regularity results on the ‘relativistic’ heat equation

We prove some partial regularity results for the entropy solution u of the so-called relativistic heat equation. In particular, under some assumptions on the initial condition u₀, we prove that ut(t) is a Radon measure in RN. Moreover, if u₀ is log-concave inside its support Ω, Ω being a convex set, then we show the solution u(t) is also log-concave in its support Ω(t). This implies its smoothness in Ω(t). In that case we can give a simpler characterization of the notion of entropy solution.     

Convex Sobolev inequalities and spectral gap

This Note is devoted to the proof of convex Sobolev (or generalized Poincaré) inequalities which interpolate between spectral gap (or Poincaré) inequalities and logarithmic Sobolev inequalities. We extend to the whole family of convex Sobolev inequalities results which have recently been obtained by Cattiaux, and Carlen and Loss for logarithmic Sobolev inequalities. Under local conditions on the density of the measure with respect to a reference measure, we prove that spectral gap inequalities imply all convex Sobolev inequalities including in the limit case corresponding to the logarithmic Sobolev inequalities. To cite this article: J.-P. Bartier, J. Dolbeault, C. R. Acad. Sci. Paris, Ser. I 342 (2006).