k-树的补图的最小填充和树宽

一个图的最小填充问题是寻求边数最少的弦母图,一个图的树宽问题是寻求团数最小的弦母图,这两个问题分别在稀疏矩阵计算及图的算法设计中有非常重要的作用．一个k-树G的补图G称为k-补树．本文给出了k-补树G的最小填充数f(G) 及树宽TW(G)．     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.     

A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.     

具有模糊数的模糊多目标群体决策优选模型与方法

多目标群体决策问题是运筹学的一个重要研究领域，目前已经提出了一些有效的决策方法。但对目标值和权重均为模糊数的模糊多目标群体决策问题却研究不多，本对此类模糊多目标群体决策问题进行了探讨，利用相对正理想方案与相对负理想方案概念定义了相对差异距离，进而建立了模糊多目标群体决策优选模型与方法，并通过战役决心方案的评价说明了该方法是可行、有效的，可作为军事决策与决策支持系统的备选方法。     

用自适应脉冲微扰引导混沌系统到周期解

用自适应脉冲微扰方法控制的系统的某个系统变量作为驱动,设计了一种自适应控制器方法对两个或多个响应混沌系统进行脉冲微扰,引导这些系统从混沌运动到低周期运动,实现同时控制多个混沌系统到不同的周期态. 当选择相同的自适应控制器输入变量实施脉冲微扰时,还可控制两个或多个混沌系统达到不同的周期态同步. 通过对R?ssler混沌系统的仿真研究证实了方法的有效性. 关键词： 混沌控制 系统参量 自适应控制器 脉冲微扰 周期态同步     

The Linear Fokker-Planck Equation for the Ornstein-Uhlenbeck Process as an (Almost) Nonlinear Kinetic Equation for an Isolated N-Particle System

It is long known that the Fokker-Planck equation with prescribed constant coefficients of diffusion and linear friction describes the ensemble average of the stochastic evolutions in velocity space of a Brownian test particle immersed in a heat bath of fixed temperature. Apparently, it is not so well known that the same partial differential equation, but now with constant coefficients which are functionals of the solution itself rather than being prescribed, describes the kinetic evolution (in the N→∞ limit) of an isolated N-particle system with certain stochastic interactions. Here we discuss in detail this recently discovered interpretation. An erratum to this article can be found at