The self-consistent mean spherical approximation for the one-component plasma

The consequences of choosing the adjustable hard-core diameter in the mean spherical approximation for the one-component plasma so as to achieve thermodynamic consistency between the energy and compressibility equations are investigated. Such a choice is found to be possible only for >8.5 and, although the resulting correlation functions are discontinuous, the height of the main peak in the static structure factor is remarkably accurate. Two especially noteworthy aspects of the thermodynamic results are that the compressibility equation is much more accurate than in any previous approximation free of input from computer simulations and that the nonstatic part of the internal energy has a ^1/4 dependence in the strong coupling limit in agreement with Monte Carlo data.     

A convergence result for a sequence of distributed-parameter optimal control problems

In this paper, we consider a sequence of abstract optimal control problems by allowing the cost integrand, the partial differential operator, and the control constraint set all to vary simultaneously. Using the notions of -convergence of functions,G-convergence of operators, and Kuratowski-Mosco convergence of sets, we show that the values of the approximating problems converge to that of the limit problem. Also we show that a convergent sequence of optimal pairs for the approximating problems has a limit which is optimal for the limit problem. A concrete example of parabolic optimal control problems is worked out in detail.This research was supported by NSF Grant No. DMS-88-02688.     

Lipschitzian inverse functions,directional derivatives,and applications inC 1,1 optimization

The paper shows that Thibault's limit sets allow an iff-characterization of local Lipschitzian invertibility in finite dimension. We consider these sets as directional derivatives and extend the calculus in a way that can be used to clarify whether critical points are strongly stable inC ^1,1 optimization problems.Many fruitful discussions with colleagues D. Klatte and K. Tammer as well as with H. Th. Jongen and F. Nozicka have influenced the present investigations in a very constructive manner. For the original papers concerning the sets f(x; u), the author is indebted to Prof. L. Thibault.     

Estimates of the tail of the stationary density function of certain nonlinear autoregressive processes

We consider the Markov chainX _n+1=T(X _n )+ _n , where { _n ;n1} is a ^d -valued random sequence of independent identically distributed random variables, and the functionT: ^{d d} is measurable and satisfies a suitable growth condition. Under certain conditions involvingT and the probability distribution of _n , we show that this Markov chain is ergodic. Moreover, we obtain sharp upper bounds for the tail of the corresponding stationary probability density function. In our proofs, we make use of the Leray-Schauder fixed-point theorem.     

On the convergence of the affine-scaling algorithm

The affine-scaling algorithm, first proposed by Dikin, is presently enjoying great popularity as a potentially effective means of solving linear programs. An outstanding question about this algorithm concerns its convergence in the presence of degeneracy. In this paper, we give new convergence results for this algorithm that do not require any non-degeneracy assumption on the problem. In particular, we show that if the stepsize choice of either Dikin or Barnes or Vanderbei, et al. is used, then the algorithm generates iterates that converge at least linearly with a convergence ratio of , wheren is the number of variables and (0,1] is a certain stepsize ratio. For one particular stepsize choice which is an extension of that of Barnes, we show that the cost of the limit point is within O(/(1–)) of the optimal cost and, for sufficiently small (roughly, proportional to how close the cost of the nonoptimal vertices are to the optimal cost), is exactly optimal. We prove the latter result by using an unusual proof technique, that of analyzing the ergodic convergence of the corresponding dual vectors. For the special case of network flow problems with integer data, we show that it suffices to take = 1/(6mC), wherem is the number of constraints andC is the sum of the cost coefficients, to attain exact optimality.This research is partially supported by the U.S. Army Research Office, contract DAAL03-86-K-0171 (Center for Intelligent Control Systems), by the National Science Foundation, grant NSF-ECS-8519058, and by the Science and Engineering Research Board of McMaster University.     

Light traffic for workload in queues

General exact light traffic limit theorems are given for the distribution of steadystate workloadV, in open queueing networks having as input a general stationary ergodic marked point process {(t _n ,K _n )n0 (where t_n denotes the arrival time and K_n the routing and service times of the nth customer). No independence assumptions of any kind are required of the input. As the light traffic regime, it is only required that the Palm distribution for the exogenous interarrival time converges weakly to infinity (while the service mechanism is not allowed to change much). As is already known in the context of a single-server queue, work is much easier to deal with mathematically in light traffic than is customer delayD, and consequently, our results are far more general than existing results forD. We obtain analogous results for multi-channel and infinite-channel queues. In the context of open queueing networks, we handle both the total workload in the network as well as the workload at isolated nodes.Research supported in part by the Japan Society for the Promotion of Science during the author's fellowship in Tokyo, and by NSF Grant DDM 895 7825.     

矩形群的强正则*断面

正则*断面是研究半群结构的一个重要手段,强正则*断面是正则*断面的加强.现通过研究矩形群的强正则*断面.利用已知强正则*断面的结构定理,给出了矩形群的强正则*断面的结构刻画和同构定理.     

一类强非线性Robin问题解的渐近估计

考虑了一类强非线性Robin问题,在适当的假定下,对此问题解的存在性及渐近性态作了较深入的研究.用微分不等式理论和方法对此问题的解作了渐近估计,得到了解的任意阶的一致有效的渐近展开式,进一步推广了前人的成果.     

新一类广义强非线性拟-似变分包含问题

在Hilbert空间研究了新一类广义强非线性拟—似变分包含问题，给出了其解的存在唯一性证明，所得结果改进和推广了文献中的一些已知结果。