Rearrangement Free Method for Hardy-Littlewood-Sobolev Inequalities on $\mathbb{S}^n$

For conformal Hardy-Littlewood-Sobolev(HLS) inequalities [22] and reversed conformal HLS inequalities [8] on $\mathbb{S}^n,$ a new proof is given for the attainability of their sharp constants. Classical methods used in [22] and [8] depends on rearrangement inequalities. Here, we use the subcritical approach to construct the extremal sequence and circumvent the blow-up phenomenon by renormalization method. The merit of the method is that it does not rely on rearrangement inequalities.     

Strong Converse Inequality for the Meyer-König and Zeller-Durrmeyer Operators

In this paper we give a strong converse inequality of type B in terms of unified $K$-functional $K^α_λ (f, t^2) (0 ≤ λ ≤ 1, 0 < α < 2)$ for the Meyer-König and Zeller-Durrmeyer type operators.     

Existence of solutions in variational relation problems without convexity

Two main existence conditions for solutions of variational relation problems are established without convexity. The first one is based on a finite solvability property and the second one on generalized KKM mappings. These conditions unify and strengthen several existing results in the literature on the topic. A model of satisficing process by rejection is considered which gives an economic interpretation of the introduced concepts.     

Testing local-realism and macro-realism under generalized dichotomic measurements

Generalized quantum measurements with two outcomes are fully characterized by two real parameters, dubbed as sharpness parameter and biasedness parameter and they can be linked with different aspects of the experimental setup. It is known that sharpness parameter characterizes precision of the measurements and decreasing sharpness parameter of the measurements reduces the possibility of probing quantum features like quantum mechanical (QM) violation of local-realism (LR) or macro-realism (MR). Here we investigate the effect of biasedness together with that of sharpness of measurements and find a trade-off between those two parameters in the context of probing QM violations of LR and MR. Interestingly, we also find that the above mentioned trade-off is more robust in the latter case.     

Littlewood-Paley inequalities in uniformly convex and uniformly smooth Banach spaces

It is proved that the inequality δX(ε)?cεp, p?2, where δX is the modulus of convexity of X, is sufficient and necessary for the inequality

     

Gamma算子在Orlicz空间L*_Φ(0,∞)中加Jacobi权同时逼近的强逆不等式

讨论由Young函数生成的Orlicz空间L*_Φ(0,∞)的性质,并给出Orlicz空间L*_Φ(0,∞)具有Hardy-Littlewood性质的充要条件,然后借助加Jacobi权修正的K-泛函和加Jacobi权连续模及其等价性建立Gamma算子在Orlicz空间L*_Φ(0,∞)中加权同时逼近的两种强逆不等式.     

On the solution existence of implicit quasivariational inequalities with discontinuous multifunctions

In this article, we established some solution existence theorems for implicit quasivariational inequalities. We first established some results in finite-dimensional spaces and then a solution existence result in infinite-dimensional spaces was derived. Our theorems are proved for discontinuous mappings and sets which may be unbounded. The results presented in this article are improvements of results in Cubiotti, and Yao (Cubiotti, P. and Yao, J.C., 1997, Discontinuous implicit quasi-variational inequalities with applications to fuzzy mappings. Mathematical Methods of Operations Research, 46, 213–328; Cubiotti, P. and Yao, J.C., 2007, Discontinuous implicit generalized quasi-variational inequalities in Banach spaces. Journal of Global Optimization (To appear))     

A smoothing method for mathematical programs with equilibrium constraints

Received May 3, 1996 / Revised version received November 19, 1997 Published online January 20, 1999     

Analytical Linear Inequality Systems and Optimization

In many interesting semi-infinite programming problems, all the constraints are linear inequalities whose coefficients are analytical functions of a one-dimensional parameter. This paper shows that significant geometrical information on the feasible set of these problems can be obtained directly from the given coefficient functions. One of these geometrical properties gives rise to a general purification scheme for linear semi-infinite programs equipped with so-called analytical constraint systems. It is also shown that the solution sets of such kind of consistent systems form a transition class between polyhedral convex sets and closed convex sets in the Euclidean space of the unknowns.