Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions

We prove the Kuhn-Tucker sufficient optimality condition, the Wolfe duality, and a modified Mond-Weir duality for vector optimization problems involving various types of invex-convexlike functions. The class of such functins contains many known generalized convex functions. As applications, we demonstrate that, under invex-convexlikeness assumptions, the Pontryagin maximum principle is a sufficient optimality condition for cooperative differential games. The Wolfe duality is established for these games.The author is indebted to the referees and Professor W. Stadler for valuable remarks and comments, which have been used to revise considerably the paper.     

独立不同分布随机变盆序列的部分和的增量有多小

关于独立同分布随机变量部分和的增量有多小问题，目前已有了著名的结果.本文通过与独立同分布情形时完全不同的途径，讨论了独立不同分布情形时相应的问题.在矩母函数存在的条件下，获得了与同分布情形相近的结论.     

Combinatorial Optimization by Dynamic Contraction

A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem.     

广义复合隐迭代格式逼近非扩张映像公共不动点

提出并使用如下广义复合隐迭代格式逼近非扩张映像族{Ti}Ni=1公共不动点:{xn=αnxn-1 (1-αn)Tnyn,yn=rnxn snxn-1 tnTnxn wnTnxn-1,rn sn tn wn=1,{αn},{rn},{sn},{tn},{wn}∈[0,1],这里Tn=TnmodN.该文提出的广义复合隐迭代格式包含了目前多种迭代格式,因此,所得强弱收敛定理推广及发展了Mann,Ishikawa,XuandOri,等许多作者的结果.     

逆序数的应用

本文通过“1 4-1 5”智力玩具和最优戴断切割问题两个实例 ,讨论了逆序数在解决实际问题中的应用     

Assessment of some iterative methods for non-symmetric linear systems arising in computational fluid dynamics

Various tests have been carried out in order to compare the performances of several methods used to solve the non-symmetric linear systems of equations arising from implicit discretizations of CFD problems, namely the scalar advection-diffusion equation and the compressible Euler equations. The iterative schemes under consideration belong to three families of algorithms: relaxation (Jacobi and Gauss-Seidel), gradient and Newton methods. Two gradient methods have been selected: a Krylov subspace iteration method (GMRES) and a non-symmetric extension of the conjugate gradient method (CGS). Finally, a quasi-Newton method has also been considered (Broyden). The aim of this paper is to provide indications of which appears to be the most adequate method according to the particular circumstances as well as to discuss the implementation aspects of each scheme.     

关于Erdos-Jacobson-Lehel 问题的门槛

设σ(k,n）表示最小的正整数m，使得对于每个n项正可图序列，当其项和至少为m时，有一个实现含k 1个顶点的团作为其子图。Erdos等人猜想：σ(k,n）＝（k-1)(2n-k) 2.Li等人证明了这个猜想对于k≥5，n≥（^k2））＋3是对的，并且提出如下问题：确定最小的整数N（k），使得这个猜想对于n≥N(k）成立。他们同时指出：当k≥5时，[5k-1/2]≤N(k）≤（^k2) 3.Mubayi猜想：当k≥5时，N(k）＝[5k-1/2]。在本文中，我们证明了N（8）＝20，即Mubayi猜想对于k=8是成立的。     

Incremental unknowns preconditioning for solving the Helmholtz equation

An efficient preconditioner is developed for solving the Helmholtz problem in both high and low frequency (wavenumber) regimes. The preconditioner is based on hierarchical unknowns on nested grids, known as incremental unknowns (IU). The motivation for the IU preconditioner is provided by an eigenvalue analysis of a simplified Helmholtz problem. The performance of our preconditioner is tested on the iterative solution of two‐dimensional electromagnetic scattering problems. When compared with other well‐known methods, our technique is shown to often provide a better numerical efficacy and, most importantly, to be more robust. Moreover, for the best performance, the number of IU levels used in the preconditioner should be designed for the coarsest grid to have roughly two points per linear wavelength. This result is consistent with the conventional sampling criteria for wave phenomena in contrast with existing IU applications for solving the Laplace/Poisson problem, where the coarsest grid comprises just one interior point. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A duality relation for busy cycles inGI/G/1 queues

Using a generalization of the classical ballot theorem, Niu and Cooper [7] established a duality relation between the joint distribution of several variables associated with the busy cycle inM/G/1 (with a modified first service) and the corresponding joint distribution of several related variables in its dualGI/M/1. In this note, we generalize this duality relation toGI/G/1 queues with modified first services; this clarifies the original result, and shows that the generalized ballot theorem is superfluous for the duality relation.