Equilibrium Problems under Generalized Convexity and Generalized Monotonicity

Generalized convex functions preserve many valuable properties of mathematical programming problems with convex functions. Generalized monotone maps allow for an extension of existence results for variational inequality problems with monotone maps. Both models are special realizations of an abstract equilibrium problem with numerous applications, especially in equilibrium analysis (e.g., Blum and Oettli, 1994). We survey existence results for equilibrium problems obtained under generalized convexity and generalized monotonicity. We consider both the scalar and the vector case. Finally existence results for a system of vector equilibrium problems under generalized convexity are surveyed which have applications to a system of vector variational inequality problems. Throughout the survey we demonstrate that the results can be obtained without the rigid assumptions of convexity and monotonicity.     

Vector Equilibrium Problems. Existence Theorems and Convexity of Solution Set

The natural quasi-concavity of set-valued mappings in an ordered vector space is introduced. Existence theorems for vector equilibrium problems involving set-valued monotone mappings are obtained and the convexity of the solution set is shown.     

Generalized Monotonicity of Subdifferentials and Generalized Convexity

Characterizations of convexity and quasiconvexity of lower semicontinuous functions on a Banach space X are presented in terms of the contingent and Fréchet subdifferentials. They rely on a general mean-value theorem for such subdifferentials, which is valid in a class of spaces which contains the class of Asplund spaces.     

Duality for Equilibrium Problems under Generalized Monotonicity

Duality is studied for an abstract equilibrium problem which includes, among others, optimization problems and variational inequality problems. Following different schemes, various duals are proposed and primal–dual relationships are established under certain generalized convexity and generalized monotonicity assumptions. In a primal–dual setting, existence results for a solution are derived for different generalized monotone equilibrium problems within each duality scheme.     

Generalized convexity and inequalities

Let R₊=(0,∞) and let M be the family of all mean values of two numbers in R₊ (some examples are the arithmetic, geometric, and harmonic means). Given m₁,m₂∈M, we say that a function is (m₁,m₂)-convex if f(m₁(x,y))?m₂(f(x),f(y)) for all x,y∈R₊. The usual convexity is the special case when both mean values are arithmetic means. We study the dependence of (m₁,m₂)-convexity on m₁ and m₂ and give sufficient conditions for (m₁,m₂)-convexity of functions defined by Maclaurin series. The criteria involve the Maclaurin coefficients. Our results yield a class of new inequalities for several special functions such as the Gaussian hypergeometric function and a generalized Bessel function.     

Equilibrium problems with set-valued mappings in Banach spaces

In this paper we consider two classes of equilibrium problems which imply general α$\alpha$-pseudomonotonicity and general α$\alpha$-semipseudomonotonicity relative to a set-valued map on reflexive and nonreflexive Banach spaces, respectively. Using the classical KKM technique, we obtain some existence results under boundedness as well as under unboundedness assumptions. Some examples are given.     

Variational Problem,Generalized Convexity,and Application to a Competitive Equilibrium Problem

The main purpose of this article is to present a new formulation of a competitive equilibrium in terms of a suitable quasivariational inequality involving multivalued maps. More precisely, a pure exchange economy is considered where the consumer's preferences are represented by utility functions that we assume to be generalized concave and non-differentiable. In the concave context, we have characterized the equilibrium by means of a variational problem involving the subdifferential. Now, by relaxing concavity and differentiability assumptions on utility functions, the subdifferential operator of the utility function is replaced by a suitable multimap involving a new concept, recently introduced in [1 D. Aussel and N. Hadjisavvas ( 2005 ). Adjusted sublevel sets, normal operator and quasiconvex programming . SIAM J. Optim. 16 : 358 – 367 .[Crossref], [Web of Science ®] , [Google Scholar]]: the normal operator to the adjusted sublevel sets. Thanks to this variational formulation we are able to achieve the existence of equilibrium points by using arguments of the set-valued analysis. Finally, we provide some example of utility functions which verify our assumptions.     

Convexity of trace functionals and Schrödinger operators

Let H be a semi-bounded self-adjoint operator on a separable Hilbert space. For a certain class of positive, continuous, decreasing, and convex functions F we show the convexity of trace functionals of the form tr(F(H+U−ε(U)))−ε(U), where U is a bounded, self-adjoint operator and ε(U) is a normalizing real function—the Fermi level—which may be identical zero. If additionally F is continuously differentiable, then the corresponding trace functional is Fréchet differentiable and there is an expression of its gradient in terms of the derivative of F. The proof of the differentiability of the trace functional is based upon Birman and Solomyak's theory of double Stieltjes operator integrals. If, in particular, H is a Schrödinger-type operator and U a real-valued function, then the gradient of the trace functional is the quantum mechanical expression of the particle density with respect to an equilibrium distribution function f=−F^′. Thus, the monotonicity of the particle density in its dependence on the potential U of Schrödinger's operator—which has been understood since the late 1980s—follows as a special case.     

Convexity is equivalent to midpoint convexity combined with strict quasiconvextiy

It was recently shown by Nikodem that a function defined on an open convex subset of R ⁿ is convex if and only if it is midpoint convex and quasiconvex. It is shown that quasiconvexity can be replaced by strict quasiconvexity and that the openness condition can be removed altogether. The domain can then be taken from a general real linear space. There will also be given some related results of a “local” nature     

Generalized Convexity of Functions and Generalized Monotonicity of Set-Valued Maps

We establish connections between some concepts of generalized monotonicity for set-valued maps introduced earlier and some notions of generalized convexity. Moreover, a notion of pseudomonotonicity for set-valued maps is introduced; it is shown that, if a function f is continuous, then its pseudoconvexity is equivalent to the pseudomonotonicity of its generalized subdifferential in the sense of Clarke and Rockafellar.     

Iterative Algorithms for Equilibrium Problems

We consider equilibrium problems in the framework of the formulation proposed by Blum and Oettli, which includes variational inequalities, Nash equilibria in noncooperative games, and vector optimization problems, for instance, as particular cases. We show that such problems are particular instances of convex feasibility problems with infinitely many convex sets, but with additional structure, so that projection algorithms for convex feasibility can be modified in order to improve their convergence properties, mainly achieving global convergence without either compactness or coercivity assumptions. We present a sequential projections algorithm with an approximately most violated constraint control strategy, and two variants where exact orthogonal projections are replaced by approximate ones, using separating hyperplanes generated by subgradients. We include full convergence analysis of these algorithms.     

On generalized cyclically monotone operators and proper quasimonotonictty

In this paper we consider an abstract subdifferential that fulfills a prioria weak type of a mean value property. We survey and extend some recent results connecting the gener-alized convexity of nonsmooth functions with the generalized cyclic monotonidty of their subdifferentials. It is shown that, for a large class of subdifferentials, a Isc function is quasiconvex if and only if its subdifferential is a cyclically quasimonotone operator. An analogous property holds for pseudoconvexity. It is also shown that the subdiffer-ential of a quasiconvex function is properly quasimonotone. This property is slightly stronger than quasimonotonicity, and is more useful in applications connected with variational inequalities     

非线性广义系统平衡点的定性分析

本文研究非线性广义系统平衡点的定性行为．利用系统的正则性，证明了可以通过其线性系统的定性行为研究非线性系统的定性性态，为定性研究非线性系统提供了一种方法．     

Generalized Vector Equilibrium Problems with Trifunctions

In this paper, we study the existence of strong and weak solutions of the generalized vector equilibrium problems for trifunctions. Two special classes of vector-valued trifunctions are introdcued, called the classes of (SPM) and (GPM), respectively. Some existence results for strong solutions associated to functions of these classes are given.     

Optimality Conditions for Vector Optimization Problems with Generalized Convexity in Real Linear Spaces

In this paper we consider mainly vector optimization problems under generalized cone-convexlikeness and generalized cone-subconvexlikeness in real linear spaces having or not topology. We establish the adapted definitions to wide frame of real linear spaces, and we show the characterizations for several concepts of generalized convexity and the relationships among them. From separation theorems, some characterizations of efficiency and weak efficiency are given in terms of scalarization. A new extension of Gordan-form alternative theorem is given here, and derived from it, we obtain optimality conditions by means of linear operators rules and saddle point criterions.     

一个关于广义Legendre关系猜测的简单证明与推广

该文通过揭示Gauss超几何函数的某些组合形式的单调性,给出了关于广义Legendre恒等式的猜测的一个简单证明,并将此猜测的结果作了进一步推广,有助于特殊函数理论的研究.     

A Note on Equilibrium Problems with Properly Quasimonotone Bifunctions

In this paper, we consider some well-known equilibrium problems and their duals in a topological Hausdorff vector space X for a bifunction F defined on K x K,where K is a convex subset of X. Some necessary conditions are investigated, proving different results depending on the behaviour of F on the diagonal set. The concept of proper quasimonotonicity for bifunctions is defined, and the relationship with generalized monotonicity is investigated. The main result proves that the condition of proper quasimonotonicity is sharp in order to solve the dual equilibrium problem on every convex set.     

On Minimax Fractional Optimality and Duality with Generalized Convexity

In this paper, we establish several sufficient optimality conditions for a class of generalized minimax fractional programming. Based on the sufficient conditions, a new dual model is constructed and duality results are derived. Our study naturally unifies and extends some previously known results in the framework of generalized convexity and dual models. Mathematics Subject Classifications: 90C25, 90C32, 90C47.     

Generalized Equilibrium Problems and Generalized Complementarity Problems

From a general minimax inequality or an abstract lopsided saddle-point theorem, we deduce general Karamardian-type equilibrium theorems and generalized complementarity theorems. Our new results extend a number of well-known earlier works of many authors.     

带扰动映像的广义平衡问题和不动点问题的混合粘性逼近问题

引入一个用于寻求带扰动映像的广义平衡问题解集以及可数无穷多非扩张映像之族公共不动点集的公共解的新的迭代算法. 证明了由此算法生成的序列的强收敛性. 所得的结果推广改进了先前许多作者的结果.