凹(凸)算子的不动点定理及其应用

凹（凸）算子的不动点定理及其应用李福义，梁展东（山西大学数学系，太原０３０００６）１９９２年１０月６日收到．近二十年来，人们对α凹（－α凸）算子，凹（凸）算子，一般凹（凸）算子以及减算子这四类非线性算于，用Ｈｉｌｂｅｒｔ投影距离、单调迭代技巧、拓扑...     

Ф凹（-φ）凸混合单调算子不动点存在惟一性及其应用

该文引入了Ф凹（-φ）凸算子，统一处理了一类具有某种凹凸性的混合单调算子，在非紧非连续的条件下，利用单调叠代技巧证明了不动点的存在惟一，进而得到了具有α凹-凸、凹-（-α）凸、α凹-Guo凸、凹-Guo凸、e凹-Guo凸、e凹-凸、e凹-（-α）凸以及α1凹-（-α）凸等性质的混合单调算子的新不动点定理，并将所获结果应用于Hammerstein非线性积分方程．     

α-方程的C_(p,q)~(k α)-形式解及其上确界范数估计

文中研究了－－方程在拟凸域上的积分解算子的性质，得到了－－方程在具Ｃｋ（ｋ≥０）类边界的拟凸开集上的Ｃｋ＋αｐ，ｑ－形式的积分算子解及其解的上确界范数估计，它包含了文［１］仅对Ｃ∞的情形     

φ凹(-Ψ)凸混合单调算子不动点存在惟一性及其应用

该文引入了φ凹-(—ψ)凸算子,统一处理了一类具有某种凹凸性的混合单调算子,在非紧非连续的条件下,利用单凋叠代技巧证明了不动点的存在惟一,进而得到了具有α凹-凸、凹-(—α)凸、α凹-Guo凸、凹-Guo凸、e凹-Guo凸、e凹-凸、e凹-(—α)凸以及α_1凹-(—α_2)凸等性质的混合单调算子的新不动点定理,并将所获结果应用于Hammerstein非线性积分方程。     

关于Hermite-Fejer插值过程的平均收敛

文［１］讨论了某些非Ｗ－过程的插值算子的加权平均逼近的收敛性和收敛阶．如记Ｈｎ（ｆ；ｘ）为以第二类Ｃｈｅｂｙｓｈｅｖ多项式Ｕｎ（ｘ）的零点作为插值节点，区间［－１，１］上的函数ｆ（ｘ）的Ｈｅｒｍｉｔｅ－Ｆｅｊｅｒ插值算子，［１］中证得：定理Ａ当０＜ｐ...     

关于多元多项式逼近的一些结果

本文首先用积分型线性正算子实现了C（［-π,π］m×［-α,α］k）上多元代数与三角多项式的混合逼近．进而，通过构造更具体的乘积核，还得到了C（［-π,π］m）上三角逼近的。维Rogosinski型逼近定理及Cr（［-1，1］k）上k维代数多项式逼近的Timan型定理．     

一类求解单调变分不等式的隐式方法

1．引言变分不等式是一个非常有趣。非常困难的数学问题［"］．它具有广泛的应用（例如，数学规划中的许多基本问题都可以归结为一个变分不等式问题），因而得到深入的研究并有了不少算法［1，2，5－8，17－21］．对线性单调变分不等式，我们最近提出了一系列投影收缩算法Ig－13］．本文考虑求解单调变分不等式其中0CW是一闭凸集，F是从正p到自身的一个单调算子，一即有我们用比（·）表示到0上的投影．求解单调变分不等式的一个简单方法是基本投影法［1，6］，它的迭代式为然而，如果F不是仿射函数，只有当F一致强单调且LIPSChitZ连续…     

具有多项式增长的退缩拟线性抛物变分不等式

考虑拟线性抛物型变分不等式：ｕ∈Ｋａ．ｅ．，〈Ａｕ′，ｖ－ｕ〉∫Ωａｉ（ｘ，ｕ，ｕ）（ｖ－ｕ）ｘｉｄｘ＋∫Ωａ（ｘ，ｕ，ｕ）（ｖ－ｕ）ｄｘ≥０ａ．ｅ．ｔ，ｖ∈Ｋ，这里Ｋ为闭凸集，Ａ为非１—１，可能退缩的线性算子．在ａｉ（ｘ，ｕ，ｐ），ａ（ｘ，ｕ，ｐ）关于ｐ，ｕ具有多项式增长的假设下，得到了正则解的存在性和唯一性．特别是，当Ａ＝Ｉ时，我们便得到文［１０］的结果．     

Goldstein, Levitin-Polyak投影法中的一个可行步长准则

１引　言设Ω是Ｒｎ空间的一个非空的凸闭紧子集,Ｆ是Ｒｎ→Ｒｎ的算子．我们考虑变分不等式问题： 变分不等式问题在数学规划中起着很重要的作用,因此,长期以来一直受到广泛的重视．求解变分不等式问题的方法中,有一类投影迭代方法,例如［１,４,６,９］．在所有的投影迭代方法中,Ｇｏｌｄｓｔｅｉｎ［６］,Ｌｅｖｉｔｉｎ－Ｐｏｌｙａｋ［９］所提出的方法;是最简单的．这里,ＰΩ（ｘ）是ｘ在　上的投影,即　的唯一解． 我们称算子Ｆ在集合Ω上是单调的,若在用Ｇｏｌｄｓｔｅｉｎ,Ｌｅｖｉｔｉｎ－Ｐｏｌｙａｋ方法（２）求…     

(?)-方程的Cｐ，ｑｋ＋α-形式解及其上确界范数估计

文中研究了(?)－方程在拟凸域上的积分解算子的性质，得到了(?)－方程在具Ｃ^ｋ（ｋ≥０）类边界的拟凸开集上的Ｃ_ｐ，ｑ^ｋ＋α－形式的积分算子解及其解的上确界范数估计，它包含了文［１］仅对Ｃ^∞的情形     

近于凸函数新子类的偏差定理和卷积性质

引进了近于凸函数的新子类.利用从属关系得到了偏差定理和卷积性质.所得结果推广了一些作者的相关结果,并得到有趣的新结果.     

FC-空间上的连续选择和邻近选择定理

给出了-些从仿紧拓扑空间到FC-空间的新的连续选择;也给出了-些从仿紧拓扑空间到局部FC-一致空间的新的邻近选择.这些结果改进且推广了-些近来的结论.     

Some Gradient Estimates and Liouville Properties of the Fast Diffusion Equation on Riemannian Manifolds*

In the paper, the authors provide a new proof and derive some new elliptic type (Hamilton type) gradient estimates for fast diffusion equations on a complete noncompact Riemannian manifold with a fixed metric and along the Ricci flow by constructing a new auxiliary function. These results generalize earlier results in the literature. And some parabolic type Liouville theorems for ancient solutions are obtained.     

Nontrivial solutions for resonant cooperative elliptic systems via computations of the critical groups

In this paper, we consider a class of resonant cooperative elliptic systems. Based on some new results concerning the computations of the critical groups and the Morse theory, we establish some new results about the existence and multiplicity of solutions under new classes of conditions. It turns out that our main results sharply improve some known results in the literature.     

Stability, resonance and Lyapunov inequalities for periodic conservative systems

This paper is devoted to the study of Lyapunov type inequalities for periodic conservative systems. The main results are derived from a previous analysis which relates the best Lyapunov constants to some especial (constrained or unconstrained) minimization problems. We provide some new results on the existence and uniqueness of solutions of nonlinear resonant and periodic systems. Finally, we present some new conditions which guarantee the stable boundedness of linear periodic conservative systems.     

关于随机算子若干问题的研究

研究了新的随机不动点指数的计算问题,利用随机不动点指数的理论推广了著名的Amann定理.提出了随机算子的随机渐进歧点的新概念,并且研究了随机k(ω)-集压缩算子的随机渐进歧点的一些问题,也得到了若干新的结果.     

Sharp bounds for spectral radius of nonnegative weakly irreducible tensors

We obtain the sharp upper and lower bounds for the spectral radius of a nonnegative weakly irreducible tensor. By using the technique of the representation associate matrix of a tensor and the associate directed graph of the matrix, the equality cases of the bounds are completely characterized by graph theory methods. Applying these bounds to a nonnegative irreducible matrix or a connected graph (digraph), we can improve the results of L. H. You, Y. J. Shu, and P. Z. Yuan [Linear Multilinear Algebra, 2017, 65(1): 113–128], and obtain some new or known results. Applying these bounds to a uniform hypergraph, we obtain some new results and improve some known results of X. Y. Yuan, M. Zhang, and M. Lu [Linear Algebra Appl., 2015, 484: 540–549]. Finally, we give a characterization of a strongly connected k-uniform directed hypergraph, and obtain some new results by applying these bounds to a uniform directed hypergraph.     

On partitioning of hypergraphs

We study edge-isoperimetric problems (EIP) for hypergraphs and extend some technique in this area from graphs to hypergraphs. In particular, we establish some new results on a relationship between the EIP and some extremal poset problems, and apply them to obtain an exact solution of the EIP for certain hypergraph families. We also show how to solve the EIP on hypergraphs in some cases when the link to posets does not work. Another outcome of our results is a new series of hypergraphs admitting nested solutions in the EIP.     

离散神经网络指数稳定的增强李亚普诺夫方法

This paper addresses the problem of robust stability for a class of discrete-time neural networks with time-varying delay and parameter uncertainties.By constructing a new augmented Lyapunov-Krasovskii function,some new improved stability criteria are obtained in forms of linear matrix inequality（LMI） technique.Compared with some recent results in the literature,the conservatism of these new criteria is reduced notably.Two numerical examples are provided to demonstrate the less conservatism and effectiveness of the proposed results.     

一种求解鞍点问题的广义对称超松弛迭代法

本文研究了鞍点问题的迭代算法.利用新的待定参数加速迭代格式并结合SSOR分裂的方法,获得了有两个参数的广义对称超松弛迭代法及其收敛性条件.数值例子表明选择适当的参数值可以提高算法的收敛效率,推广和改进了SOR-like迭代法.