Analytic hypoellipticity in the presence of nonsymplectic characteristic points

Recently, N. Hanges proved that the operator

     

Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems

The purpose of this paper is to present an accelerated hybrid viscosity and steepest-descent method for solving proximal split feasibility problems (if solutions exist) in real Hilbert spaces. We obtain strong convergence of the sequence generated by our scheme under some suitable conditions on the parameters. In all our results in this work, our iterative schemes are proposed with a way of selecting the step sizes such that their implementation does not need any prior information about the bounded linear operator norm. Finally, we give numerical comparisons of our results with other established result to verify the efficiency and implementation of our new method.     

强收敛的球松弛CQ算法及其应用

为了求解分裂可行问题,Yu等提出了一个球松弛CQ算法.由于该算法只需计算到闭球上的投影,同时不需要计算有界线性算子的范数,该算法是容易实现的.但是球松弛CQ算法在无穷维Hilbert空间中仅仅具有弱收敛性.首先构造了一个强收敛的球松弛CQ算法.在较弱的条件下,证明了算法的强收敛性.其次将该算法应用到一类闭凸集上的投影问...     

DCLR与TLA共混改性沥青的性能对比

以SK-90沥青为基质沥青,分别加入相同掺量(与沥青质量比为5%、10%、15%和20%)的DCLR和TLA,利用SHRP PG、针入度分级体系、红外光谱仪和凝胶色谱仪对比分析DCLR和TLA共混改性沥青的宏观性能和微观结构的变化。结果表明,DCLR和TLA的加入均可以改善沥青的高温性能,但对沥青的低温性能和疲劳性能产生一定的不利影响。同时,根据DCLR和TLA共混改性沥青的官能团和分子量分布的变化可以判断DCLR和TLA对沥青的改性作用主要为物理改性,在某种程度上,DCLR不能完全替代TLA。     

Banach空间中非线性混合型脉冲积微分方程的解

本文讨论Ｂａｎａｃｈ空间中带定时脉冲的非线性混合型积微分方程，利用Ｄａｒｂｏ不动点定理与增算子不动点定理证明了解与最大解和最小解的存在性，得到了最大解和最小解的迭代公式．     

A multiprojection algorithm using Bregman projections in a product space

Generalized distances give rise to generalized projections into convex sets. An important question is whether or not one can use within the same projection algorithm different types of such generalized projections. This question has practical consequences in the area of signal detection and image recovery in situations that can be formulated mathematically as a convex feasibility problem. Using an extension of Pierra's product space formalism, we show here that a multiprojection algorithm converges. Our algorithm is fully simultaneous, i.e., it uses in each iterative stepall sets of the convex feasibility problem. Different multiprojection algorithms can be derived from our algorithmic scheme by a judicious choice of the Bregman functions which govern the process. As a by-product of our investigation we also obtain blockiterative schemes for certain kinds of linearly constraned optimization problems.     

多指标试验设计的优化分析

本文给出了多指标试验设计优化分析的归二模型及相应的两种优化方法。并通过一个案例与其它方法进行了比较     

4一致(ξ)-超图的最小边数的上界

主要讨论了4一致l-超图的最小边数与最小上色数的关系,给出了上色数为3的4一致l-超图的最小边数的一个上界.     

分裂可行问题(SFP)的投影算法

本文探讨了分裂可行问题(SFP)的投影算法．我们先定义了(SFP)的反问题(ISFP), 然后利用正交投影性质,给出了(SFP)与(ISFP)及某些投影不动点问题之间的关系．随后, 给出了求解(SFP)的几种正交投影算法,其中包括精确和不精确投影格式．基于变分不等式中投影算法收敛性的证明思路和分裂可行问题的特有形式,证明了这几种算法的收敛性．最后通过几个算例对讨论的方法进行了初步比较．     

The generalized assignment problem with flexible jobs

The Generalized Assignment Problem (GAP) seeks an allocation of jobs to capacitated resources at minimum total assignment cost, assuming a job cannot be split among multiple resources. We consider a generalization of this broadly applicable problem in which each job must not only be assigned to a resource, but its resource consumption must also be determined within job-specific limits. In this profit-maximizing version of the GAP, a higher degree of resource consumption increases the revenue associated with a job. Our model permits a job’s revenue per unit resource consumption to decrease as a function of total resource consumption, which allows modeling quantity discounts. The objective is then to determine job assignments and resource consumption levels that maximize total profit. We develop a class of heuristic solution methods, and demonstrate the asymptotic optimality of this class of heuristics in a probabilistic sense.