非连续的增算子的不动点定理及其对含间断项的非线性方程的应用

<正> 本文是作者工作[1]的继续. 关于增算子的不动点定理,在数学的许多领域,特别是在非线性微分方程和非线性积分方程中,有着广泛的应用(见[2][3]L4][5][6]).设E是Banach空间,P是E中的锥,D=[u_o,ν_o]是E中的序区间,A:D→E是增算子,满足u_o≤Au_o,Au_o≤ν_o.关于增算子的三个有代表性的结论是:     

重调和扰动问题的无穷多解

本文考虑有界区域中具有零边值条件的重调和扰动问题,所得结论包含了[1][3][4]中的相应结果。     

(＋∞∑n-1)1/n2m的初等解法

本文用初等的方法研究(＋∞∑n-1)1/n2m(m∈N)的求和问题. 这个问题最先由Euler[8]解决.文献[1][6]给出了另两种求解方法.特别地,对于m=1的情形,即(＋∞∑n-1)1/n2=∏2/6,已有许多不同的证明方法,可见文献[2][3][4][5]以及那里的参考文献.本文的想法,主要受文献[5][6]的启发而来的.     

子空间上的对称正定及对称半正定阵的左右特征值反问题

文[1][2][3]中讨论AX＝B的对称阵逆特征值问题，文[4][5][6]中讨论了半正定阵的逆特征值问题。本文讨论了空间了子空间上的对称正定及对称半正定阵的左右特征值反问题，给出了解存在的充分条件及解的表达式。     

一类具磁场效应的三维非线性Schrdinger方程组的整体解及其渐近性质

§1.引言一类具有磁场效应的Zakharov方程组及其对应的非线性Schrdinger方程组已在[1][2]中提出,并在物理上进行了研究.在[3]中,我们从数学上证明了该方程组在R~2空间上解的存在性.在[4]中,我们研究了它的初边值问题在     

格值模型论中的省略型定理

<正> 我们在[2][3]开始的工作中,对于多值模型论准备作一些初步考查.我们已经讨论了2-值模型论中超积基本定理及紧致性定理在多值时的初步推广.本文是这一工作的继续,我们将证明某些值格时的省略型定理.文中有些概念及记号可参看[2]、[3]、[4](但本文的内容与[2]、[3]无关).以下再补充叙述一些与本文有关的概念.     

Hammerstein 型非线性积分方程的固有值

<正> 本文是作者工作[7]的继续.§1应用拓扑度数理论[1][2][3][5][6]研究实用上常见的多项式型 Hammerstein 非线性积分方程的固有值,即设     

方程u″-△u+|u|~pulog~k(1+|u|)=f的存在唯一性

我们知道非线性双曲方程是在相对论量子力学的研究中提出的问题(参看[1][2])。在[3][4][5]中,人们研究了这个方程在Sobolev空间中的可解性,本文用Sobolev-Orlicz空间理论和Faedo-galerkin方法,讨论非线性双曲方程的初边值问题的可解性。在(P,K)平面上,我们给出了这个方程的存在区域和唯一区域,并指出已有结果包括在K=0的特殊情形中。     

拓扑代数的Arens正则性

Arens在Banach代数A的第二对偶A^**中定义了两种乘积,称为Arens乘积.Gulick和Hennefeld又分别讨论了Arens正则性的刻划.在文[4]中,我们把文[1]中的定义和[2][3]中的结果推广到一类局部凸拓扑代数.本文讨论具有H性质的Z-代数的Arens正则性的问题,得到了Arens正则的充分必要条件。     

相似抛物线的一组性质

文[1][2]分别讨论了相似椭圆和双曲线具有的性质,而所有的抛物线都是相似的,那么相似抛物线是否也具有类似的性质呢?笔者经过研究,发现相似抛物线也具有与文[2]中的定理3完全相同的性质.     

The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces

In general normed spaces,we consider a multiobjective piecewise linear optimization problem with the ordering cone being convex and having a nonempty interior.We establish that the weak Pareto optimal solution set of such a problem is the union of finitely many polyhedra and that this set is also arcwise connected under the cone convexity assumption of the objective function.Moreover,we provide necessary and suffcient conditions about the existence of weak(sharp) Pareto solutions.     

A modified wolfe dual for weak vector minimization

A version of the Wolfe dual problem is constructed for constained weak minimization of a vector objective function, in finite or infinite dimensions (e.g. continuous programming) The usual convex requirements are weakened to invex. Weak duality is replaced by an inclusion, constructed using the cone defining the weak minimum. Relations with Pareto (or proper Pareto) minima are discussed.     

Extremal Convex Planar Sets

Each convex planar set K has a perimeter C, a minimum width E, an area A, and a diameter D. The set of points (E,C, A^1/2, D) corresponding to all such sets is shown to occupy a cone in the non-negative orthant of R⁴with its vertex at the origin. Its three-dimensional cross section S in the plane D = 1 is investigated. S lies in a rectangular parallelepiped in R³. Results of Lebesgue, Kubota, Fukasawa, Sholander, and Hemmi are used to determine some of the boundary surfaces of S, and new results are given for the other boundary surfaces. From knowledge of S, all inequalities among E, C ,A, and D can be found.     

Full nuclear cones associated to a normal cone. Application to Pareto efficiency

We introduce in this paper the notion of “full nuclear cone”, and we show that a nontrivial full nuclear cone can be associated to any normal cone in a locally convex space. We apply this notion to the study of Pareto efficiency.     

偏好意义下的Pareto极值存在性定理及其应用

本文给出了偏好意义下的Ｐａｒｅｔｏ极值存在性定理．作为应用,得到了推广的Ｗｅｉｅｒｓｔｒａｓｓ定理以及非连续集值增算子的不动点定理．     

Generalized Clarke Epiderivatives of Parametric Vector Optimization Problems

This paper deals with the generalized Clarke epiderivative of the extremum (or efficient point) multifunction in parametric vector optimization problems. The formulas for computing and/or estimating the generalized Clarke epiderivative of this extremum multifunction are given in terms of the Clarke tangent cone to the graph of a multifunction or the constraint mapping and/or the Fréchet derivative of the objective function. An application to semi-infinite programming is given.     

On Regularity for Constrained Extremum Problems. Part 2: Necessary Optimality Conditions

A particular theorem for linear separation between two sets is applied in the image space associated with a constrained extremum problem. In this space, the two sets are a convex cone, depending on the constraints (equalities and inequalities) of the given problem and the homogenization of its image. It is proved that the particular linear separation is equivalent to the existence of Lagrangian multipliers with a positive multiplier associated with the objective function (i.e., a necessary optimality condition). A comparison with the constraint qualifications and the regularity conditions existing in the literature is performed.     

Contingent cone to a set defined by equality and inequality constraints at a Fréchet differentiable point

In this paper, we prove equality expression for the contingent cone and the strict normal cone to a set determined by equality and/or inequality constraints at a Fréchet differentiable point. A similar result has appeared before in the literature under the assumption that all the constraint functions are of classC or under the assumption that the functions are strictly differentiable at the point in question. Our result has applications to the calculation of various kinds of tangent cones and normal cones.This research was supported, in part by the National Science and Engineering Research Council of Canada under Grant No. OGP-41983.The authors would like to thank D. E. Ward for his many helpful comments.     

Nuclear cones in product spaces,pareto efficiency and Ekeland-type variational principles in locally convex spaces

In this article, we present a method to obtain new Ekeland-type variational principles for mappings defined between locally convex spaces. The method is based on a special nuclear cone defined in a product of two locally convex spaces and on Pareto efficiency with respect to this cone.     

Fuzzy Optimization Problems Based on Ordering Cones

The solution concepts of the fuzzy optimization problems using ordering cone (convex cone) are proposed in this paper. We introduce an equivalence relation to partition the set of all fuzzy numbers into the equivalence classes. We then prove that this set of equivalence classes turns into a real vector space under the settings of vector addition and scalar multiplication. The notions of ordering cone and partial ordering on a vector space are essentially equivalent. Therefore, the optimality notions in the set of equivalence classes (in fact, a real vector space) can be naturally elicited by using the similar concept of Pareto optimal solution in vector optimization problems. Given an optimization problem with fuzzy coefficients, we introduce its corresponding (usual) optimization problem. Finally, we prove that the optimal solutions of its corresponding optimization problem are the Pareto optimal solutions of the original optimization problem with fuzzy coefficients.