The measure of a translated ball in uniformly convex spaces

Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r ^q , whereq depends on the properties of the norm. We specify it in the case ofL spaces, >1.     

Recursive solution of linear-quadratic Nash games for weakly interconnected systems

A recursive method is developed for the solution of coupled algebraic Riccati equations and corresponding linear Nash strategies of weakly interconnected systems. It is shown that the given algorithm converges to the exact solution with the rate of convergence ofO(²), where is a small coupling parameter. In addition, only low-order systems are involved in algebrdic computations; the amount of computations required does not grow per iteration and no analyticity assumption is imposed on the system coefficients.This work was supported by Rutgers University Research Council under Grant No. 2-02188.     

The lion and man problem revisited

A pursuerP, whose speed is bounded by 1, wants to get closer to an evaderE, whose speed is bounded by >1.P wants to reduce his distancePE fromE below the capture radius . Both players are confined to a circular arena. This problem is equivalent to a problem discussed by Flynn, who characterized and gave numerical bounds to the least upper boundd* on the values ofPE thatE can maintain. He used direct methods and did not use Isaacs' theory.We solve our problem relying on the theory of singular surfaces in differential games. We construct and investigate barriers of the game of kind, and we replace Flynn's bounds ond* by analytical (exact) values for various speeds .The support of the TW Department of THT, Enschede, Holland, is gratefully acknowledged.     

A new approach for the derivation of bounds for the Jensen difference

There are many useful applications of Jensen's inequality in several fields of science, and due to this reason, a lot of results are devoted to this inequality in the literature. The main theme of this article is to present a new method of finding estimates of the Jensen difference for differentiable functions. By applying definition of convex function, and integral Jensen's inequality for concave function in the identity pertaining the Jensen difference, we derive bounds for the Jensen difference. We present integral version of the bounds in Riemann sense as well. The sharpness of the proposed bounds through examples are discussed, and we conclude that the proposed bounds are better than some existing bounds even with weaker conditions. Also, we present some new variants of the Hermite–Hadamard and Hölder inequalities and some new inequalities for geometric, quasi-arithmetic, and power means. Finally, we give some applications in information theory.     

Randomized algorithms for the separation of point sets and for solving quadratic programs

A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space ^d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia.     

Banach spaces that admit support sets

It is shown that the existence of a closed convex set all of whose points are properly supported in a Banach space is equivalent to the existence of a certain type of uncountable ordered one-sided biorthogonal system. Under the continuum hypothesis, we deduce that this notion is weaker than the existence of an uncountable biorthogonal system.

     

Quantitative stability of variational systems: III.ε-approximate solutions

We prove that the-optimal solutions of convex optimization problems are Lipschitz continuous with respect to data perturbations when these are measured in terms of the epi-distance. A similar property is obtained for the distance between the level sets of extended real valued functions. We also show that these properties imply that the-subgradient mapping is Lipschitz continuous.Research supported in part by the National Science Foundation and the Air Force Office of Scientific Research.     

Statistical mechanics of a dynamical system based on Conway's game of Life

We study a discrete dynamical system whose evolution is governed by rules similar to those of Conway's game of Life but also include a stochastic element (parametrized by a temperature). Statistical properties that are examined are density as a function of temperature and entropy (suitably defined). A phase transition and a certain thermodynamic constant of the motion are observed.Lady Davis Visiting Scientist at the Technion 1974–75.     

Mixed strategy solutions forN-person quadratic games

Mixed strategy -equilibrium points are given forN-person games with cost functions consisting of quadratic, bilinear, and linear terms and strategy spaces consisting of closed balls in Hilbert spaces. The results are applied to linear-quadratic differential games with no information and quadratic integral constraints on the control functions.This work was supported by a Commonwealth of Australia, Postgraduate Research Award.