关于Bernstein—Kantorovich—Bezier对一类绝对连续函数的逼近算子

利用经典的Bojanie-Cheng方法,结合分析技术,分别讨论了Bernstein-Kantorovich-Bezier算子在0〈a≤1及a≥1时,对一类绝对连续函数的逼近．     

调和级数的发散及其应用

级数是表示函数、进行数值计算的一个有力工具。调和级数作为级数的一个基本成员,结构简单。调和级数的发散及其应用给出了调和级数发散性的4种证明;并分别在比较审敛法和极限比较判别法中,举例说明调和级数在判断无穷级数的敛散性时的标尺作用。     

关于级数收敛判定准则的一个充要条件

通过实例从正反两方面探讨了数项级数收敛与数列极限的相互关系,在此基础上给出了数列收敛与级数收敛判定准则的一个充要条件．     

Proximal point algorithm for a new class of fuzzy set-valued variational inclusions with (H,η)-monotone mappings

We introduced a new class of fuzzy set-valued variational inclusions with (H,η)-monotone mappings. Using the resolvent operator method in Hilbert spaces, we suggested a new proximal point algorithm for finding approximate solutions, which strongly converge to the exact solution of a fuzzy set-valued variational inclusion with (H,η)-monotone. The results improved and generalized the general quasi-variational inclusions with fuzzy set-valued mappings proposed by Jin and Tian [Jin MM, Perturbed proximal point algorithm for general quasi-variational inclusions with fuzzy set-valued mappings, OR Transactions, 2005, 9(3): 31-38, (In Chinese); Tian YX, Generalized nonlinear implicit quasi-variational inclusions with fuzzy mappings, Computers & Mathematics with Applications, 2001, 42: 101-108].     

中高职思政课程衔接问题及应对策略

中高职衔接是目前我国职业教育中的热点话题,其中如何构建中高职课程的衔接,实现我国职业教育体系建设的战略目标,是热点之中的热点.本文主要结合中高职思政课程衔接的现状及存在的问题进行重点探讨,并提出相应的应对策略.     

Non-interior continuation algorithm for solving system of inequalities over symmetric cones

As a basic mathematical structure,the system of inequalities over symmetric cones and its solution can provide an effective method for solving the startup problem of interior point method which is used to solve many optimization problems.In this paper,a non-interior continuation algorithm is proposed for solving the system of inequalities under the order induced by a symmetric cone.It is shown that the proposed algorithm is globally convergent and well-defined.Moreover,it can start from any point and only needs to solve one system of linear equations at most at each iteration.Under suitable assumptions,global linear and local quadratic convergence is established with Euclidean Jordan algebras.Numerical results indicate that the algorithm is efficient.The systems of random linear inequalities were tested over the second-order cones with sizes of 10,100,,1 000 respectively and the problems of each size were generated randomly for 10 times.The average iterative numbers show that the proposed algorithm can generate a solution at one step for solving the given linear class of problems with random initializations.It seems possible that the continuation algorithm can solve larger scale systems of linear inequalities over the secondorder cones quickly.Moreover,a system of nonlinear inequalities was also tested over Cartesian product of two simple second-order cones,and numerical results indicate that the proposed algorithm can deal with the nonlinear cases.     

改正的牛顿迭代法

给出一种改正的牛顿迭代法,证明了其是二阶收敛的,数值例子表明,改正的牛顿迭代法的迭代速度优于牛顿法及弦截法。     

模拟退火算法

本文介绍了Metropolis准则,给出模拟退火算法的算法步骤以及收敛性定理．最后,给出了模拟退火算法运用的数值例子．     

防止遗传算法成熟前收敛的有效方法(英)

从群体多样性角度对成熟前收敛的成因进行了分析,并提出了两个有关定理．根据分析结果,提出了基于群体多样性和自适应交叉、变异率的改进遗传算法．通过四个典型函数的实例验证,证明了本文提出的改进遗传算法是一种有效算法．     

一个逼近方程解的迭代法

利用泰勒展开理论,给出一个逼近方程f(x)=0的解的迭代方法,并证明了迭代收敛,且收敛速度比牛顿迭代法快得多.