Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

选择最小方差阈值的判别式方法

本文阐述了选择最小方差阈值的各次累积矩判别式方法,证明了零次矩判别式最小方差阈值选择法在理论上可使统计累积矩的次数降到最低,在实用上可进一步减少运算量。     

OnQ-order andR-order of convergence

We give sufficient conditions for a sequence to have theQ-order and/or theR-order of convergence greater than one. If an additional condition is satisfied, then the sequence has an exactQ-order of convergence. We show that our results are sharp and we compare them with older results.This work was supported in part by the National Science Foundation under Grant No. DMS-85-03365. The author wishes to thank J. E. Dennis and R. A. Tapia for helpful comments, and the referee for pointing out a number of typographical and mathematical errors in the original version of this paper.     

Uniform convergence of Galerkin‐multigrid methods for nonconforming finite elements for second‐order problems with less than full elliptic regularity

In this article we prove uniform convergence estimates for the recently developed Galerkin‐multigrid methods for nonconforming finite elements for second‐order problems with less than full elliptic regularity. These multigrid methods are defined in terms of the “Galerkin approach,” where quadratic forms over coarse grids are constructed using the quadratic form on the finest grid and iterated coarse‐to‐fine intergrid transfer operators. Previously, uniform estimates were obtained for problems with full elliptic regularity, whereas these estimates are derived with less than full elliptic regularity here. Applications to the nonconforming P₁, rotated Q₁, and Wilson finite elements are analyzed. The result applies to the mixed method based on finite elements that are equivalent to these nonconforming elements. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 203–217, 2002; DOI 10.1002/num.10004     

用遗传算法求解课程表问题

课程表问题是NP完全类问题.近些年来人们尝试着用进化算法求此问题.本文根据大学编排课表的特点设计了一种全新的编码和适应值函数,并应用遗传算法求解.试验说明了该方法的可行性和有效性.     

一个一维非标准逆热传导问题的Fourier正则化方法

一维非标准逆热传导问题ut ux =uxx,u(1,t) =g(t) ,u(x ,0 ) =0 ,　0≤ x <∞ ,0 相似文献   

天然树脂局部结构的径向分布函数研究

本工作用x射线衍射技术分析计算了二种天然树脂的局部结构参数,由测得的衍射强度数据求出了它们的结构因子I(r)和径向分布函数RDF(r),并由此得到了分子链内临近原子和次临近原子平均间距、配位数和短程有序畴。     

非线性随机规划问题最优值与最优解的可测性

利用对偶理论与可测集值映射理论等,本文首次证明了一般非线性随机规划问题最优值和最优解的可测性,从而为研究它们的概率分布、矩等分布问题以及一般随机规划问题的实际求解奠定了理论基础.     

试论村庄下采煤的技术问题

文章讨论了村庄下采煤的技术问题。     

使用MPLS解决网络最大流问题的方法

为解决大多数的流量工程问题和网络传输中的最大流问题，该文提出了基于多协议标签交换（MPLS）解决方案，阐述了解决最大流问题的数学方法，提出一种独特的将数据流划分成“微分支”的思想和方法，并介绍微分支的建立过程；给出仿真结果。