An approximate Newton method for non-smooth equations with finite max functions

A new version of finite difference approximation of the generalized Jacobian for a finite max function is constructed. Numerical results are reported for the generalized Newton methods using this approximation.     

A genetic k-medoids clustering algorithm

We propose a hybrid genetic algorithm for k-medoids clustering. A novel heuristic operator is designed and integrated with the genetic algorithm to fine-tune the search. Further, variable length individuals that encode different number of medoids (clusters) are used for evolution with a modified Davies-Bouldin index as a measure of the fitness of the corresponding partitionings. As a result the proposed algorithm can efficiently evolve appropriate partitionings while making no a priori assumption about the number of clusters present in the datasets. In the experiments, we show the effectiveness of the proposed algorithm and compare it with other related clustering methods.     

极小化完工时间和的有界批调度问题

考虑m台并行批加工同型机上n个带有释放时间的工件的调度问题,目标是极小化完工时间和.给出了一个多项时间近似方案.     

置换空间中的最佳逼近

我们首次得到了置换空间PXXn中的点到太阳集的最佳逼近特征定理.     

Raising approximation order of refinable vector by increasing multiplicity

An algorithm is presented for raising an approximation order of any given orthogonal multiscaling function with the dilation factor a. Let φ(x) = [φ1(x),φ2(x),…,φr(x)]T be an orthogonal multiscaling function with the dilation factor a and the approximation order m. We can construct a new orthogonal multiscaling function φnew(x) = [ φT(x). f3r 1(x),φr 2(x),…,φr s(x)}T with the approximation order m L(L ∈ Z ). In other words, we raise the approximation order of multiscaling function φ(x) by increasing its multiplicity. In addition, we discuss an especial setting. That is, if given an orthogonal multiscaling function φ(x) = [φ1 (x), φ2(x), …, φr(x)]T is symmetric, then the new orthogonal multiscaling function φnew(x) not only raise the approximation order but also preserve symmetry. Finally, some examples are given.     

W_2~m[a,b]空间中线性泛函最佳逼近的深入讨论

本文基础上给出了Wm2(a,b)空间再生核构造的普遍方法,并利用再生核讨论算于插值样条的投影性质及最佳数值逼近问题     

关于酉对称矩阵的QR分解及其算法

为了简化大型行(列)酉对称矩阵的QR分解,研究了行(列)酉对称矩阵的性质,获得了一些新的结果,给出了行(列)酉对称矩阵的QR分解的公式和快速算法,它们可极大地减少行(列)酉对称矩阵的QR分解的计算量与存储量,并且不会丧失数值精度.同时推广和丰富了邹红星等(2002)的研究内容,拓宽了实际应用领域的范围.     

Imperialist competitive algorithm combined with chaos for global optimization

A novel chaotic improved imperialist competitive algorithm (CICA) is presented for global optimization. The ICA is a new meta-heuristic optimization developed based on a socio-politically motivated strategy and contains two main steps: the movement of the colonies and the imperialistic competition. Here different chaotic maps are utilized to improve the movement step of the algorithm. Seven different chaotic maps are investigated and the Logistic and Sinusoidal maps are found as the best choices. Comparing the new algorithm with the other ICA-based methods demonstrates the superiority of the CICA for the benchmark functions.     

Normal systems over ANR’s, rigid embeddings and nonseparable absorbing sets

Most of results of Bestvina and Mogilski [Characterizing certain incomplete infinite-di-mensional absolute retracts. Michigan Math. J., 33, 291-313 (1986)] on strong Z-sets in ANR's and absorbing sets is generalized to nonseparable case. It is shown that if an ANR X is locally homotopy dense embeddable in infinite-dimensional Hilbert manifolds and w(U ) = w(X ) (where "w"is the topological weight) for each open nonempty subset U of X , then X itself is homotopy dense embeddable in a Hilbert manifold. It is also demonstrated that whenever X is an AR, its weak product W (X, ) = {(x n ) ∞ n=1 ∈ X ω : x n = for almost all n} is homeomorphic to a pre-Hilbert space E with E ～ = ΣE. An intrinsic characterization of manifolds modelled on such pre-Hilbert spaces is given.