Extrapolated Smoothing Descent Algorithm for Constrained Nonconvex and Nonsmooth Composite Problems*

In this paper, the authors propose a novel smoothing descent type algorithm with extrapolation for solving a class of constrained nonsmooth and nonconvex problems,where the nonconvex term is possibly nonsmooth. Their algorithm adopts the proximal gradient algorithm with extrapolation and a safe-guarding policy to minimize the smoothed objective function for better practical and theoretical performance. Moreover, the algorithm uses a easily checking rule to update the smoothing parameter to ensure that any accumulation point of the generated sequence is an (affine-scaled) Clarke stationary point of the original nonsmooth and nonconvex problem. Their experimental results indicate the effectiveness of the proposed algorithm.     

Optimizing constrained subtrees of trees

Given a treeG = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the rooted subtree problem, is to find a maximum weight subtree, with a specified root, from a given set of subtrees.The second problem, called the subtree packing problem, is to find a maximum weight packing of node disjoint subtrees chosen from a given set of subtrees, where the value of each subtree may depend on its root.We show that the complexity status of both problems is related, and that the subtree packing problem is polynomial if and only if each rooted subtree problem is polynomial. In addition we show that the convex hulls of the feasible solutions to both problems are related: the convex hull of solutions to the packing problem is given by pasting together the convex hulls of the rooted subtree problems.We examine in detail the case where the set of feasible subtrees rooted at nodei consists of all subtrees with at mostk nodes. For this case we derive valid inequalities, and specify the convex hull whenk 4.Research supported in part by Nato Collaborative Research Grant CRG 900281, Science Program SC1-CT91-620 of the EEC, and contract No 26 of the programme Pôle d'attraction interuniversitaire of the Belgian government.     

A law of the iterated logarithm for processes with independent increments

ＡＬＡＷＯＦＴＨＥＩＴＥＲＡＴＥＤＬＯＧＡＲＩＴＨＭＦＯＲＰＲＯＣＥＳＳＥＳＷＩＴＨＩＮＤＥＰＥＮＤＥＮＴＩＮＣＲＥＭＥＮＴＳＷＡＮＧＪＩＡＧＡＮＧ（汪嘉冈）（ＥａｓｔＣｈｉｎａＵｎｉｖｅｒｓｉｔｙｏｆＳｃｉｅｎｃｅ＆Ｔｅｃｈｎｏｌｏｇｙ,Ｓｈａｎｇ...     

Invariance of the cone algebra without asymptotics

Let B be a manifold with conical singularities, and denote by the smooth bounded manifold with cylindrical ends obtained by blowing up near the singularities.B.-W. Schulze has developed a framework for a pseudodifferential calculus on B by defining various classes of distribution spaces and operator algebras, working in fixed coordinates on the manifold . I am showing here that the Mellin Sobolev spaces without asymptotics, the cone algebra without asymptotics, and its ideal of smoothing operators are independent of the choice of coordinates and therefore may be considered intrinsic objects for manifolds with conical singularities.     

Optimality of a Threshold Policy in theM/M/ queue with repeated vacations

Consider anM/M/1 queueing system with server vacations where the server is turned off as soon as the queue gets empty. We assume that the vacation durations form a sequence of i.i.d. random variables with exponential distribution. At the end of a vacation period, the server may either be turned on if the queue is non empty or take another vacation. The following costs are incurred: a holding cost ofh per unit of time and per customer in the system and a fixed cost of each time the server is turned on. We show that there exists a threshold policy that minimizes the long-run average cost criterion. The approach we use was first proposed in Blanc et al. (1990) and enables us to determine explicitly the optimal threshold and the optimal long-run average cost in terms of the model parameters.     

Curvature invariants, differential operators and local homogeneity

We first prove that a Riemannian manifold with globally constant additive Weyl invariants is locally homogeneous. Then we use this result to show that a manifold whose Laplacian commutes with all invariant differential operators is a locally homogeneous space.

     

解平行四边形板弯曲问题的二元B样条有限元法

将文献［１］以二元二次Ｂ样条函数为基底,求解矩形薄板弯曲问题的二元Ｂ样条有限元的方法推广到用于求解平行四边形板弯曲问题．结果表明：该方法系数矩阵每行的非零元仅２１个,相对于朱明权和ＣｈｕｉＣ．Ｋ．等的张量积型样条有限元方法,计算量与存贮量都大大节约．     

柔性机构动力学分析的有限元件法

对柔性机构动力学进行建模和计算机模拟。方法以组成机构的构件为单元,把构件的刚性运动和弹性变形统一用模态参数表示;以梁单元为代表分析了集中质量及分布质量情况下的梁的惯性特征;引入弹性的概念,     

多沙水源取水泵站正向前池边壁型式及圆形进水池尺寸的确定

通过理论分析、模型试验和对现有多沙水源取水工程的调查,研究并给出了正向前池边壁的合理曲线型式和圆形进水池尺寸的确定方法。研究结果可应用于实际工程。     

Weibull分布和极值分布场合下简单步进应力加速寿命试验的最优设计

产品的加速寿命试验被用来较快地获得关于产品寿命分布的信息.本文研究了Weibull分布和极小值分布下简单步加试验的最优设计问题.为解决Nelson折算法对极小值分布的数据处理产生特殊情况的问题,作者应用近年来一些新的研究成果,将位置-尺度分布中的尺度参数设为随应力变化的量进行最优设计.给出一实例,并将其推广到更一般的形式.