一类非拟Newton算法及其收敛性

本文对求解无约束最优化问题提出一类非拟Ｎｅｗｔｏｎ算法，此方法同样具有二次终止性，产生的矩阵序列保持正定对称传递性，并证明了新类中的任何一种算法的全局收敛和超线性收敛性。     

大步长非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法的全局收敛性

本文在ZhangH．C．的非单调线搜索规则基础上，结合ShiZ．J．大步长线搜索技巧提出了新的大步长的非单调线搜索规则，设计了求解无约束最优化问题的大步长非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法，在△f（x）一致连续的条件下给出了算法的全局收敛性和超线性收敛性分析．数值例子表明算法是有效的，适合求解大规模问题．     

非单调带参数Perry-Shanno无记忆拟牛顿法的收敛性

给出了一种非单调带参数的Perry-Shanno无记忆拟牛顿法, 对于目标函数为凸函数, 在参数满足适当范围的情况下, 证明了算法的全局收敛性.     

等式约束优化非单调信赖域算法

设计了一个新的求解等式约束优化问题的非单调信赖域算法.该算法不需要罚函数也无需滤子.在每次迭代过程中只需求解满足下降条件的拟法向步及切向步.新算法产生的迭代步比滤子方法更易接受,计算量比单调算法小.在一般条件下,算法具有全局收敛性.     

新非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法

本文设计了求解无约束最优化问题的新的非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法.新的步长规则类似于Grippo非单调线搜索规则并包含Grippo非单调线搜索规则作为特例.新的步长规则在每一次线搜索时得到一个相对于Grippo非单调线搜索规则的较大步长,同时保证算法的全局收敛性.数值例子表明算法是有效的,适合求解大规模问题.     

非光滑最优控制问题的一种数值解法

针对非光滑最优控制问题提出一种分段数值解法.首先对问题进行全局拟谱离散,然后选取分点,将时间区域进行剖分,在每段区域上对问题进行离散,离散过程采用Chebyshev-Legendre拟谱方法,可以有效借助快速Legendre变换提高算法的运算效率,比现有算法在很大程度上节省了计算时间.给出了相关的理论分析,数值结果表明方法的高精度和有效性.     

非光滑区域上非自治Navier-Stokes 方程非齐边界问题的吸引子

本文研究在2维Lipschitz区域上Navier-Stokes方程的非齐边界问题的长时间行为，在外力是时间的拟周期下，通过引入双参过程的概念，证明一致吸引子A的存在性，并给出一致吸引子A的Hausdorff维数的上界估计。     

渐近拟非扩张非自映射的收敛定理

在实线性赋范空间中引入了渐近拟非扩张非自映射概念.并在Banach空间中证明了渐近拟非扩张非自映射对的强收敛定理,所得结果推广和改进了相关文献的结论.     

非拟牛顿非凸族的收敛性

１．引言 对于无约束最优化问题拟牛顿法是目前最成熟,应用最广泛的解法之一．近二十多年来,对拟牛顿法收敛性质的研究一直是非线性最优化算法理论研究的热点．带非精确搜索的拟牛顿算法的研究是从１９７６年 Ｐｏｗｅｌｌ［１］开始,他证明了带 Ｗｏｌｆｅ搜索 ＢＦＧＳ算法的全局收敛性和超线性收敛性． １９７８年 Ｂｙｒｄ, Ｎｏｃｅｄａｌ; Ｙａ－Ｘｉａｎｇ Ｙｕａｎ［３］成功地将 Ｐｏｗｅｌｌ的结果推广到限制的 Ｂｒｏｓｄｅｎ凸族． １９８９年, Ｎｏｃｅｄａｌ［４］在目标函数一致凸的条件下,证明了带回追搜索的ＢＦＧ…     

求非光滑全局优化问题的区间算法

本文通过区间工具和目标函数的特殊导数提出了一个非光滑全局优化问题的区间算法，所提出的方法能给出问题的全部全局极小点及全局极小值，理论分析和数值结构均表明本文方法是有效的。     

Model theory for hyponormal contractions

Agler's abstract model theory is applied to the family of hyponormal contractions. A sufficient condition for an operator to be extremal in this family is given, and this is used to show that the boundary, or smallest model, for the family is the whole family.     

Rota-Baxter簇系统与Gr\"obner-Shirshov基

从Yang-Baxter簇方程和Volterra积分方程得到的Rota-Baxter簇代数的概念出发,我们引入Rota-Baxter簇系统的概念,推广了Brzezinski提出的Rota-Baxter系统.我们证明这个概念也与结合Yang-Baxter簇对和pre-Lie簇代数有关.此外,作为Rota-Baxter簇系统的一个类比,我们引入平均簇系统的概念,并证明平均簇系统会得到dialgebra簇结构.我们还研究dendriform代数上的Rota-Baxter簇系统,并展示它们如何诱导quadri簇代数结构.最后,我们用Gr\"obner-Shirshov基的方法给出Rota-Baxter簇系统的一个线性基.     

Family sequencing and cooperation

This paper analyzes a single-machine scheduling problem with family setup times both from an optimization and a cost allocation perspective. In a family sequencing situation jobs are processed on a single machine, there is an initial processing order on the jobs, and every job within a family has an identical cost function that depends linearly on its completion time. Moreover, a job does not require a setup when preceded by another job from the same family while a family specific setup time is required when a job follows a member of some other family.     

Admissibility of prediction intervals

Admissibility of prediction intervals is considered in a specified family. It is shown that the best invariant prediction interval is strongly admissible in a location family and in a scale family. Though the similar result has not been obtained for a location and scale family, the best invariant prediction interval for a normal distribution is shown to be weakly admissible.     

A simple permutoassociahedron

In the early 1990s, a family of combinatorial CW-complexes named permutoassociahedra was introduced by Kapranov, and it was realised by Reiner and Ziegler as a family of convex polytopes. The polytopes in this family are “hybrids” of permutohedra and associahedra. Since permutohedra and associahedra are simple, it is natural to search for a family of simple permutoassociahedra, which is still adequate for a topological proof of Mac Lane’s coherence. This paper presents such a family.     

超额控制权与企业现金持有——基于家族创始人控制的调节效应

本文基于代理成本理论、动态权衡理论,选取2007年~2017年中国沪、深A 股家族上市公司数据,实证检验了家族企业超额控制权对现金持有水平的内在影响。研究结论显示:(1)家族超额控制权与现金持有水平显著正相关;(2)而家族创始人控制能够有效的抑制家族超额控制权对现金持有水平的影响。在控制了超额控制权的影响之后,进一步研究发现:(3)与非创始控制家族相比,创始家族的现金持有水平显著低于非创始家族。本文的研究结论不仅在微观治理层面,进一步证实了家族超额控制的“寻租观”,与此同时也揭示出,创始人在家族企业公司治理中所扮演的积极角色。     

Quantum families of quantum group homomorphisms

The notion of a quantum family of maps has been introduced in the framework of C*-algebras. As in the classical case, one may consider a quantum family of maps preserving additional structures (e.g. quantum family of maps preserving a state). In this paper, we define a quantum family of homomorphisms of locally compact quantum groups. Roughly speaking, we show that such a family is classical. The purely algebraic counterpart of the discussed notion, i.e. a quantum family of homomorphisms of Hopf algebras, is introduced and the algebraic counterpart of the aforementioned result is proved. Moreover, we show that a quantum family of homomorphisms of Hopf algebras is consistent with the counits and coinverses of the given Hopf algebras. We compare our concept with weak coactions introduced by Andruskiewitsch and we apply it to the analysis of adjoint coaction.     

Separately normal maps

It is shown that a separately normal map is holomorphic and a separately normal family which is separately uniformly normal is a normal family extending a result by Barth that a separately holomorphic map into hyperbolic spaces is holomorphic and a separately normal family of maps into hyperbolic spaces is a normal family.     

Maximal Monotone Operators, Convex Functions and a Special Family of Enlargements

This work establishes new connections between maximal monotone operators and convex functions. Associated to each maximal monotone operator, there is a family of convex functions, each of which characterizes the operator. The basic tool in our analysis is a family of enlargements, recently introduced by Svaiter. This family of convex functions is in a one-to-one relation with a subfamily of these enlargements. We study the family of convex functions, and determine its extremal elements. An operator closely related to the Legendre–Fenchel conjugacy is introduced and we prove that this family of convex functions is invariant under this operator. The particular case in which the operator is a subdifferential of a convex function is discussed.     

Friedberg Numberings of Families of n-Computably Enumerable Sets

We establish a number of results on numberings, in particular, on Friedberg numberings, of families of d.c.e. sets. First, it is proved that there exists a Friedberg numbering of the family of all d.c.e. sets. We also show that this result, patterned on Friedberg's famous theorem for the family of all c.e. sets, holds for the family of all n-c.e. sets for any n>2. Second, it is stated that there exists an infinite family of d.c.e. sets without a Friedberg numbering. Third, it is shown that there exists an infinite family of c.e. sets (treated as a family of d.c.e. sets) with a numbering which is unique up to equivalence. Fourth, it is proved that there exists a family of d.c.e. sets with a least numbering (under reducibility) which is Friedberg but is not the only numbering (modulo reducibility).