函数强伪凸性与映射强伪单调性

1　引　　言Schaible在[1]中引入七类单调映射,并证明对其中六类,函数的某种广义凸性都和相应的梯度单调性等价,只有函数强伪凸和梯度强伪单调的等价性是否成立作为公开问题.其后,Schaible又在[2]中通过一个例子否定了两者的等价性,并引入了较弱的函数强伪凸和映射强伪单调的概念,在函数二次可微的条件下证明了函数强伪凸和梯度强伪单调等价.我们将引入强于[2]中概念的强伪凸和强伪单调性,对给出的定义,不附加条件便可保证函数强伪凸性和梯度强伪单调性等价.同时,对[2]中的一个错误予以指出,并给出正确的反例.还就[1]中问题给出远比[2]中简…     

广义伪凸函数的一个性质

广义伪凸函数的一个性质杨新民（重庆师范学院数学系，６３００４７）关键词广义伪凸，严格广义伪凸，判别准则．分类号ＡＭＳ（１９９１）９０Ｃ２５，２６Ｂ２５／ＣＣＬＯ２２１．２设Ｂ是Ｒ￣ｎ中单位开球，ｆ：Ｒ￣ｎ→Ｒ在点ｘ处称为Ｌｉｐｓｃｈｉｔｚ函数，即存在...     

Banach空间中优化问题的最优性条件

首先在Contingent切锥意义下界定了Banach空间中非空集合的伪切锥和伪凸性的概念，并讨论了相应的性质，然后针对可微优化问题，在广义凸性假设下，建立了最优性条件。     

伪凸集值映射的误差界

考虑了伪凸集值映射的误差界.证明了对于伪凸集值映射,局部误差界成立意味着整体误差界成立.通过相依导数,给出了伪凸集值映射存在误差界的一些等价叙述.     

拓扑向量空间中的几个锥广义凸映射

本文引进拓扑向量空间中的几个锥伪凸映射的概念,并且讨论了它们之间及其它的锥广义凸映射之间的关系,最后,给出一个显示各种关系的图表。     

参数优化的最优性及在控制问题中的一个应用

在Banach空间中,给出了含参数的单值映射的不变类凸,拟不变类凸和伪不变类凸的概念.在这类较弱凸性条件下,提出了参数优化问题弱有效解的几个最优性充分条件.作为应用,研究了一类状态约束最优控制问题的弱最优控制.     

具强制条件的向量均衡问题

研究锥伪单调、锥拟凸和上锥连续映射在某种强制性条件下的向量均衡问题解集的特征,建立强制性条件与向量均衡问题解集的关系,得到对偶向量均衡问题局部解集含于向量均衡问题解集的性质和向量均衡问题解集的非空性条件,给出在锥伪单调、锥拟凸和上锥连续映射条件下向量均衡问题解集的非空有界性与强制性条件的等价性．     

锥伪单调和锥严格拟凸映射向量平衡问题

研究在锥伪单调、锥拟凸、锥严格拟凸和次连续条件下几类二元向量平衡问题解的关系，利用KyFan不动点定理证明了解的存在性。     

非光滑向量极值问题的真有效解与最优性条件

讨论了赋范线性空间中非光滑向量极值问题的Hatley,Borwein,Benson真有效解之间的关系,指出了它们共同的标量极值问题的等价刻画,建立了问题（VMP）的广义KT-真有效解的充分条件,并给出了向量极小值问题在锥局部凸、拟凸、伪凸等条件下的最优性条件。     

多目标锥—广义凸规划有效解的充要条件

本文提出了ｎ维欧氏空间上的锥－凸、锥－伪凸、锥－拟凸向量值函数的概念，讨论了它们之间的关系，并在此基础上，对多目标数学规划问题关于凸锥∧有效解，撇开约束品性，讨论了它的充分必要条件。     

Priority centralization of the one period multi-location inventory system

In this paper, we will examine a multi-center one-period inventory system. The usual penalty cost for being out of stock will be replaced by an assurance of service constraint at each location. That is, we will constrain our inventory size to meet a specific maximum probability of being out of stock at each location. The centralized system we shall propose will define a priority rule which will cause us to satisfy the entire demand of high priority locations before we begin satisfying the demands of lower priority locations. This will allow us to find a minimum initial inventory level for the centralized system that will meet all of the assurance of service constraints. We will look at the special case where the variance of the total demand of several locations is non-decreasing in locations included in the total. In this case, we will show the computations required for finding the optimal centralized priority system are minimal. Finally, we will show that such a system is superior to a decentralized system.     

Three‐point bending tests—Part I: Mathematical study and asymptotic analysis

The goal of this work is to study the static behaviour of a three‐dimensional elastic beam when is subjected to a three‐point bending test. In the first part, under suitable compatibility conditions on the applied forces and on the geometry of the beam, we will prove the existence of a unique solution for the associated contact elastic problem; these conditions of compatibility on the data come from the absence of a Dirichlet condition on the beam boundary. In the second part, we will study the asymptotic behaviour of this problem; in particular, we will deduce the one‐dimensional models associated with the displacement components, and we will give the existence and uniqueness of solution for them. Moreover, we will give an expression for the normal axial stress in the beam which is related to the modulus of rupture of brittle materials. In the final part of the work, we will deal with the regularity of the solution for the bending problem and we will prove some properties of the coincidence set. Copyright © 2011 John Wiley & Sons, Ltd.     

A new method for similarity measures for pattern recognition

This paper points out three questionable areas in the realm of similarity measures and then provides a new method that will rectify the problem. The purpose of this paper is fourfold. First, we will propose a scenario where the three similarity measures proposed by Hung and Yang (2004) [1] are helpless in aiding a decision maker in deciding pattern recognition problem. Second, we will present our method for solving the dilemma. Third, we will show that our proposed similarity measures satisfy the axioms for well defined similarity measures. Fourth, we will prove that our method could solve pattern recognition problems. Our findings will help researchers handle similarity problems under intuitionistic fuzzy sets environment.     

Some Weighted Equi-Statistical Convergence and Korovkin Type-Theorem

In this paper, we will show a new weighted equi-statistical convergence and based on this definition we will prove a kind of the Korovkin type theorems. Also we will show the rate of the convergence for this kind of weighted statistical convergence and Voronovskaya type theorem.     

Coefficient identification in the Euler–Bernoulli equation using regularization methods

In this paper, we will study the inverse problem of identification of flexural rigidity coefficient in the Euler–Bernoulli equation. This inverse problem is ill-posed. To solve it, we will use regularization methods. In particular, we will apply the mollification method and the Landweber iteration method, in particular, to find the regularized solution of the Moore–Penrose generalized inverse to a linear operator and with this, we reconstruct the coefficient. At the end of this paper, will present some examples of interest.     

NUMERICAL METHODS FOR MAXWELL＇S EQUATIONS IN INHOMOGENEOUS MEDIA WITH MATERIAL INTERFACES

In this paper, we will present some recent results on developing numerical methods for solving Maxwell‘s equations in inhomogeneous media with material interfaces. First,we will present a second order upwinding embedded boundary method - a Cartesian grid based finite difference method with special upwinding treatment near the material interfaces. Second, we will present a high order discontinuous spectral element with Dubinar orthogonal polynomials on triangles. Numerical results on electromagnetic scattering and photonic waveguide will be included.     

Locally von Neumann algebras II

In this paper, we will prove some properties of locally von Neumann algebras. In particular, we will show that every locally von Neumann algebra is the dual of a certain locally convex space and also, we will show the existence of a polar decomposition for every element in a locally von Neumann algebra.     

What is the Ratio Test(一)

<正>Let's recall that if a series is absolutely convergent then we will also know that it's convergent and so we will often use it to simply determine the convergence of a series.Now we will start to learn a new and very useful test named the Ratio Test.The Ratio Test Suppose we have the series ∑_(a_n).And let     

On the linear complexity of binary lattices

Linear complexity is an important and frequently used measure of unpredictability and pseudorandomness of binary sequences. In this paper our goal is to extend this notion to two dimensions. We will define and study the linear complexity of binary lattices. The linear complexity of a truly random binary lattice will be estimated. Finally, we will analyze the connection between linear complexity and correlation measures, and we will utilize the inequalities obtained in this way for estimating the linear complexity of an important special binary lattice. Finally, we will study the connection between the linear complexity of binary lattices and of the associated binary sequences.     

On a Pseudorandom Property of Binary Sequences

C. Mauduit and A. Sárközy proposed the use of well-distribution measure and correlation measure as measures of pseudorandomness of finite binary sequences. In this paper we will introduce and study a further measure of pseudorandomness: the symmetry measure. First we will give upper and lower bounds for the symmetry measure. We will also show that there exists a sequence for which each of the well-distribution, correlation and symmetry measures are small. Finally we will compare these measures of pseudorandomness.