Some analytical semigroups occurring in probability theory

One-parameter semigroups occurring in operator-limit distributions are investigated. The topological-algebraic background of the relevant monoids is discussed and Lie semigroup theory is applied to the Urbanik Decomposability Semigroup.     

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.     

A characterization of brownian motion in a lipschitz domain by its killing distributions

Let (Y _t, Q^x) be a strong Markov process in a bounded Lipschitz domainD with continuous paths up to its lifetime , and let (X _t, P^x) be a Brownian motion inD. IfY _– exists in D andQ ^x(Y_– C)=P^x(X_– C) for all Borel subsetsC of D and allx, thenY is a time change ofX.     

Probability theory and polymer physics

This study applies the theory of stochastic processes to the equilibrium statistical physics of polymers in solution. The topics treated include random copolymers and randomly branching polymers, with self-consistent mean field effects. A new and more natural way of dealing with Boltzmann weighting is discussed, which makes it possible from the beginning of a calculation to consider only the physical polymer conformations. We also show that in general the random copolymer problem can be reduced to the ordinary polymer problem, and treat the self-consistent field problem for a general branching polymer.     

On Timonov's algorithm for global optimization of univariate Lipschitz functions

Timonov proposes an algorithm for global maximization of univariate Lipschitz functions in which successive evaluation points are chosen in order to ensure at each iteration a maximal expected reduction of the region of indeterminacy, which contains all globally optimal points. It is shown that such an algorithm does not necessarily converge to a global optimum.     

Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison

We consider the following global optimization problems for a Lipschitz functionf implicitly defined on an interval [a, b]. Problem P: find a globally-optimal value off and a corresponding point; Problem Q: find a set of disjoint subintervals of [a, b] containing only points with a globally-optimal value and the union of which contains all globally optimal points. A two-phase algorithm is proposed for Problem P. In phase I, this algorithm obtains rapidly a solution which is often globally-optimal. Moreover, a sufficient condition onf for this to be the case is given. In phase II, the algorithm proves the-optimality of the solution obtained in phase I or finds a sequence of points of increasing value containing one with a globally-optimal value. The new algorithm is empirically compared (on twenty problems from the literature) with a best possible algorithm (for which the optimal value is assumed to be known), with a passive algorithm and with the algorithms of Evtushenko, Galperin, Shen and Zhu, Piyavskii, Timonov and Schoen. For small, the new algorithm requires only a few percent more function evaluations than the best possible one. An extended version of Piyavskii's algorithm is proposed for problem Q. A sufficient condition onf is given for the globally optimal points to be in one-to-one correspondance with the obtained intervals. This result is achieved for all twenty test problems.The research of the authors has been supported by AFOSR grants 0271 and 0066 to Rutgers University. Research of the second author has been also supported by NSERC grant GP0036426, FCAR grant 89EQ4144 and partially by AFOSR grant 0066. We thank Nicole Paradis for her help in drawing the figures.     

Lipschitz Continuity and Interpolation Properties of Some Classes of Increasing Functions

We study local Lipschitz continuity and interpolation properties of some classes of increasing functions defined on the cone Rⁿ ₊₊ of n-vectors with positive coordinates. We also study the so-called self-conjugate increasing positively homogeneous functions.     

Generalized vector variational-like inequalities and nonsmooth vector optimization problems

In this article, we establish some relationships between a solution of generalized vector variational-like inequalities and an efficient solution or a weakly efficient solution to the nonsmooth vector optimization problem under the assumptions of pseudoinvexity or invariant pseudomonotonicity. Our results extend and improve the corresponding results in the literature.     

Generalization of tangential trace spaces of H(curl,Ω) for curvilinear Lipschitz polyhedral domains Ω

For curvilinear Lipschitz polyhedral domains Ω, explicit characterizations of the tangential trace spaces of H ¹(Ω) are presented. These extend the original characterizations given by Buffa and Ciarlet that hold on Lipschitz polyhedral domains with plane faces. The tangential trace spaces of H ¹(Ω) are fundamental for the definition, analysis and intuitive understanding of the trace spaces of H ( curl ,Ω) and therefore, more general characterizations of the latter are obtained at the same time. Copyright © 2013 John Wiley & Sons, Ltd.