Orlicz序列空间的一致单调系数及应用

本文给出了Ｏｒｌｉｃｚ序列空间一致单调系数数值，同时给出了Ｏｒｌｉｃｚ序列空间具有一致单调性的条件，进而讨论具有一致单调性的Ｏｒｌｉｃｚ序列空间中的最佳逼近算子的一些特征。     

赋Orlicz范数的Orlicz空间中最佳逼近算子

在赋Ｏｒｌｉｃｚ范数的Ｏｒｌｉｃｚ空间中,给出最佳逼近算子单调性的一个充分条件和最佳逼近元存在定理．     

赋Orlicz范数的Orlicz序列空间的接近一致凸性

本文给出了赋Ｏｒｌｉｃｚ序列空间的Ｈ点的充分必要条件,进而得至了赋Ｏｒｌｉｃｚ范数的Ｏｒｌｉｃｚ序列空间具有（Ｈ）性质的判据．同时给出了赋Ｏｒｌｉｃｚ范数的Ｏｒｌｉｃｚ序列空间的一致ＵＫＫ和接近一致凸性的等价条件。     

Orlicz序列空间的Opial性质

本文给出了Ｏｒｌｉｃｚ序列空间具有Ｏｐｉａｌ性质的条件，进而得到了具有Ｏｐｉａｌ条件的Ｏｒｌｉｃｚ序列空间中的任何一个非空的依坐标收敛闭的有界凸集上的第一类非扩张映射Ｔ必有不动点．     

Musielak－Orlicz序列空间的一些凸性

本文给出了赋Ｏｒｌｉｃｚ范数的Ｍｕｓｉｅｌａｋ－Ｏｒｌｉｃｚ序列空间的局部一致凸性，（Ｈ）性质，（Ｓ）性质的判据．     

Musielak—Orlicz序列空间的一些凸性

本文给出了赋Ｏｒｌｉｃｚ范数的Ｍｕｓｉｅｌａｋ－Ｏｒｌｉｃｚ序列空间的局部一致凸性，（Ｈ）性质，（Ｓ）性质的判据。     

Orlicz空间中支撑映射的上(下)半连续点

该文给出了赋Ｏｒｌｉｃｚ范数的Ｏｒｌｉｃｚ空间Ｌ°Ｍ中的点是支撑映射的上（下）半连续点的充分必要条件；推出了支撑映射为上（下）半连续的判别准则．     

赋Orlicz范数的Musielak-Orlicz序列空间的单调点

给出赋Ｏｒｌｉｃｚ范数的Ｍｕｓｉｅｌａｋ－Ｏｒｌｉｃｚ序列空间中上（下）单调点以及上（下）局部一致单调点的充分必要条件．     

赋Orlicz范数的Musielak-Orlicz空间的光滑点与强光滑点(英)

给出赋Ｏｒｌｉｃｚ范数的Ｍｕｓｉｅｌａｋ－Ｏｒｌｉｃｚ函数空间中光滑点、光滑性、强（很）光滑点和强（很）光滑性的充 分必要条件．     

Orlicz空间中Kantorovi(c)算子逼近等价定理

以带权函数的连续模为工具,讨论了Ｋａｎｔｏｒｏｖｉｃ算子在Ｏｒｌｉｃｚ空间中逼近的正、逆定理,进而得到其等价刻划。     

初值修正灰色Verhulst模型的参数估计

研究了初值修正项为αz(1)(1)(其中α为修正参数)的灰色Verhuslt模型的修正参数估计方法.针对相关文献中,修正参数α求解无现成公式情况,通过最小化原始序列的一次累加序列与模拟序列之差,建立并求解一个非约束优化模型,获得了初值修正参数α的一个简单有效的计算公式,完善了相关文献中建立的初值修正灰色Verhuslt模型.最后,通过计算实例验证了修正参数公式可以有效提高初值修正灰色Verhuslt模型的精度.     

A Switching Algorithm Based on Modified Quasi-Newton Equation

In this paper, a switching method for unconstrained minimization is proposed. The method is based on the modified BFGS method and the modified SR1 method. The eigenvalues and condition numbers of both the modified updates are evaluated and used in the switching rule. When the condition number of the modified SR1 update is superior to the modified BFGS update, the step in the proposed quasi-Newton method is the modified SR1 step. Otherwise the step is the modified BFGS step. The efficiency of the proposed method is tested by numerical experiments on small, medium and large scale optimization. The numerical results are reported and analyzed to show the superiority of the proposed method.     

三参数对数正态分布的参数估计

本文讨论了三参数对正态分布的参数估计问题，指出了最小二乘估计存在的问题，并提出了两种修改的最小二乘估计，模拟研究表明，这种估计较以前提出的估计有一定的优点。     

A modified candecomp algorithm for fitting the latent class model: Implementation and evaluation

In this paper an implementation is discussed of a modified CANDECOMP algorithm for fitting Lazarsfeld's latent class model. The CANDECOMP algorithm is modified such that the resulting parameter estimates are non-negative and ‘best asymptotically normal’. In order to achieve this, the modified CANDECOMP algorithm minimizes a weighted least squares function instead of an unweighted least squares function as the traditional CANDECOMP algorithm does. To evaluate the new procedure, the modified CANDECOMP procedure with different weighting schemes is compared on five published data sets with the widely-used iterative proportional fitting procedure for obtaining maximum likelihood estimates of the parameters in the latent class model. It is found that, with appropriate weights, the modified CANDECOMP algorithm yields solutions that are nearly identical with those obtained by means of the maximum likelihood procedure. While the modified CANDECOMP algorithm tends to be computationally more intensive than the maximum likelihood method, it is very flexible in that it easily allows one to try out different weighting schemes.     

解一类Hessian矩阵亏秩的修正BFGs算法及其局部Q-超线性收敛性

本文对凸函数在极值点的Hessian矩阵是秩亏一的情况下,给出了一类求解无约束优化问题的修正BFGS算法.算法的思想是对凸函数加上一个修正项,得到一个等价的模型,然后简化此模型得到一个修正的BFGS算法.文中证明了该算法是一个具有超线性收敛的算法,并且把修正的BFGS算法同Tensor方法进行了数值比较,证明了该算法对求解秩亏一的无约束优化问题更有效.     

The modified moment problem in the presence of noise

The modified moment problem is little studied in the literature with respect to the classical moment problem due to the lacking of experiments measuring modified moments. The modified moment problem is analyzed in this paper, when noise affects the modified moments themselves. A numerical method for solving the problem, based on regularization, is given, together with a full theoretical analysis, convergence results and an optimized algorithm. The modified moment problem reveals strongly superior to the classical moment problem in terms of the amplification of the error, conditioning of the matrices involved and ease of computation.     

矩阵填充的硬阈值修正算法

提出了使用硬阈值进行矩阵填充的修正算法.算法通过对迭代矩阵进行对角修正来完成矩阵填充,并给出了算法的收敛性分析.最后通过数值实验比较了修正算法与硬阈值算法填充的数值结果,显示出了新算法的优越性.     

一类非单调修正PRP算法的全局收敛性

本文给出一类非单调线性搜索下的修正PRP算法,该方法保证每次迭代中的搜索方向是充分下降的.在较弱的条件下,我们证明了此类非单调修正PRP算法具有全局收敛性.     

A type of modified BFGS algorithm with any rank defects and the local Q-superlinear convergence properties

A modified BFGS algorithm for solving the unconstrained optimization, whose Hessian matrix at the minimum point of the convex function is of rank defects, is presented in this paper.The main idea of the algorithm is first to add a modified term to the convex function for obtain an equivalent model, then simply the model to get the modified BFGS algorithm. The superlinear convergence property of the algorithm is proved in this paper. To compared with the Tensor algorithms presented by R. B. Schnabel (seing [4],[5]), this method is more efficient for solving singular unconstrained optimization in computing amount and complication.     

A nonsmooth Newton method for variational inequalities,I: Theory

This paper presents a modified damped Newton algorithm for solving variational inequality problems based on formulating this problem as a system of equations using the Minty map. The proposed modified damped-Newton method insures convergence and locally quadratic convergence under the assumption of regularity. Under the assumption ofweak regularity and some mild conditions, the modified algorithm is shown to always create a descent direction and converge to the solution. Hence, this new algorithm is often suitable for many applications where regularity does not hold. Part II of this paper presents the results of extensive computational testing of this new method.Corresponding author.