Result of search for low velocity exotic particles

The L3＋C experiment, taking advantage of the L3 muon magnetic spectrometer, measured the spatial tracks of charged cosmic ray particles to obtain rigidity as well as velocity. One possible low velocity exotic particle is observed. The existing uncertainties are discussed, and the flux upper limit of the low velocity exotic particles from this observation is deduced based on the assumption of a null observation. The result is 6.2×10^-10 cm^-2·s^-1·sr^-1 at 90% confidence level in the velocity range from 0.04c to 0.5c.     

推广线搜索下一类共轭梯度法的全局收敛性

在推广线搜索下给出了一类共轭梯度法的全局收敛结果     

IRST系统的单站机动目标跟踪算法研究

在传统的IRST（红外搜索与跟踪）系统的角测量基础上,增加了红外探测器对目标红外辐射的响应信息这一测量项,且将相邻两次测量的目标红外光谱辐射功率之比作为伪测量,以消除目标红外光谱辐射强度不确定所产生的影响,并由此构造了机动目标跟踪的IMM（交互多模型）算法. 通过跟踪一个高机动目标的仿真过程,对算法性能进行了检验.仿真结果表明:当测量误差较小时,误差的变化对跟踪精度的影响不大,整个跟踪过程中,单个坐标轴上的均方差不超过7 m,而且,大多数时刻上的均方误差不超过3 m;当测量误差较大时,近距离（航迹前段和中段）的跟踪精度也是很高的,单个坐标轴上的均方差不超过5 m,但是,远距离的跟踪精度下降很快,最大误差达到110 m;速度误差与位置误差也有类似的结果.     

正交饱和效应模型及其统计分析

文\cite{14}讨论了2水平正交饱和设计的一种统计分析方法---零效应搜索法, 本文将此方法推广到一般的饱和模型---正交饱和效应模型. 首先给出正交饱和效应模型的定义及其相关的参数估计和平方和分解, 然后用零效应搜索法对显著效应的检验问题进行分析, 模拟结果显示效果很好.     

一个带有线搜索的新信赖域方法及其收敛性

本文利用一个修正的BFGS公式,提出了一个结合Armijo线搜索条件技术的BFGS信赖域方法,并在一定条件下证明了该方法的全局收敛性和超线性收敛性.初步的数值实验结果表明该方法是有效的.     

Smoothing Newton-Like Method for the Solution of Nonlinear Systems of Equalities and Inequalities

In this paper, we present a smoothing Newton-like method for solving non-linear systems of equalities and inequalities. By using the so-called max function, we transfer the inequalities into a system of semismooth equalities. Then a smoothing Newton-like method is proposed for solving the reformulated system, which only needs to solve one system of linear equations and to perform one line search at each iteration. The global and local quadratic convergence are studied under appropriate assumptions. Numerical examples show that the new approach is effective.     

一类新的非单调记忆梯度法及其全局收敛性

在非单调Armijo线搜索的基础上提出一种新的非单调线搜索,研究了一类在该线搜索下的记忆梯度法,在较弱条件下证明了其全局收敛性。与非单调Armijo线搜索相比,新的非单调线搜索在每次迭代时可以产生更大的步长,从而使目标函数值充分下降,降低算法的计算量。     

Wolfe线搜索下一类混合共轭梯度法的全局收敛性

本文给出了一个新的共轭梯度公式,新公式在精确线搜索下与DY公式等价,并给出了新公式的相关性质.结合新公式和DY公式提出了一个新的混合共轭梯度法,新算法在Wolfe线搜索下产生一个下降方向,并证明了算法的全局收敛性,并给出了数值例子.     

A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms

Kernel functions play an important role in defining new search directions for primal-dual interior-point algorithm for solving linear optimization problems. In this paper we present a new kernel function which yields an algorithm with the best known complexity bound for both large- and small-update methods.     

无记忆非拟 Newton 算法的导出和全局收敛性

In this paper, a new class of memoryless non-quasi-Newton method for solving unconstrained optimization problems is proposed, and the global convergence of this method with inexact line search is proved. Furthermore, we propose a hybrid method that mixes both the memoryless non-quasi-Newton method and the memoryless Perry-Shanno quasi-Newton method. The global convergence of this hybrid memoryless method is proved under mild assumptions. The initial results show that these new methods are efficient for the given test problems. Especially the memoryless non-quasi-Newton method requires little storage and computation, so it is able to efficiently solve large scale optimization problems.