Convergence of diagonally stationary sequences in convex optimization

LetX be a real normed linear space,f, f ⁿ, n , be extended real-valued proper closed convex functions onX. A sequence {x _n} inX is called diagonally stationary for {f ⁿ} if for alln there existsx* _n f ⁿ (x _n) such that x* _{n *} 0. Such sequences arise in approximation methods for the problem of minimizingf. Some general convergence results based upon variational convergence theory and appropriate equi-well-posedness are presented.     

Brownian confinement and pinning in a Poissonian potential. II

Summary We continue our study ofd-dimensional Brownian motion in a soft repulsive Poissonian potential over a long time interval [0,t]. We prove here a pinning effect: for typical configuratons, with probability tending to 1 ast tends to , the particle gets trapped close to locations of near minima of certain variational problems. These locations lie at distances growing almost linearly witht from the origin, and the particle gets pinned within distance smaller than any positive power oft of one such location. In dimension 1, we can push further our estimates and show that in a suitable sense, the particle gets trapped with high probability, within time t and within distance (logt)²⁺ from a suitable location at distance of ordert/(logt)³ from the origin.This article was processed by the author using the LATEX style filepljour1m from Springer-Verlag     

On some global well-posedness and asymptotic results for quasilinear parabolic equations

We prove that the quasilinear parabolic initial-boundary value problem (1.1) below is globally well-posed in a class of high order Sobolev solutions, and that these solutions possess compact, regular attractors ast+.     

Relations on the period mapping giving extensions of mixed hodge structures on compact Riemann surfaces

We consider a period map from Teichmüller space to , which is a real vector bundle over the Siegel upper half space. This map lifts the Torelli map. We study the action of the mapping class group on this period map. We show that the period map from Teichmüller space modulo the Johnson kernel is generically injective. We derive relations that the quadratic periods must satisfy. These identities are generalizations of the symmetry of the Riemann period matrix. Using these higher bilinear relations, we show that the period map factors through a translation of the subbundle and is completely determined by the purely holomorphic quadratic periods. We apply this result to strengthen some theorems in the literature. One application is that the quadratic periods, along with the abelian periods, determine a generic marked compact Riemann surface up to an element of the kernel of Johnson's homomorphism. Another application is that we compute the cocycle that exhibits the mapping class group modulo the Johnson kernel as an extension of the group SP _g () by the group .     

Three distinct distances in the plane

For n6 all sets of n points in the plane with three distinct distances are determined.Dedicated to Professor Dr. Laszlo Fejes Töth on the occasion of his eightieth birthday     

Second-order subdifferentials of C1,1 functions and optimality conditions

We present second-order subdifferentials of Clarke's type of C ^1,1 functions, defined in Banach spaces with separable duals. One of them is an extension of the generalized Hessian matrix of such functions in ⁿ , considered by J. B. H.-Urruty, J. J. Strodiot and V. H. Nguyen. Various properties of these subdifferentials are proved. Second-order optimality conditions (necessary, sufficient) for constrained minimization problems with C ^1,1 data are obtained.This work was partially supported by the National Foundation for Scientific Investigations in Bulgaria under contract No. MM-406/1994.     

Perturbation analysis of the orthogonal procrustes problem

Given two arbitrary real matricesA andB of the same size, the orthogonal Procrustes problem is to find an orthogonal matrixM such that the Frobenius norm MA – B is minimized. This paper treats the common case when the orthogonal matrixM is required to have a positive determinant. The stability of the problem is studied and supremum results for the perturbation bounds are derived.     

Perturbed unstable variational inequalities with unbounded operators on approximately given sets

The stability and convergence of the solutions of perturbed and regularized variational inequality to the solutions of the primary (unstable a priori) variational inequality with proper monotone operator are investigated. All the objects of inequality: the operatorA, the right-hand partf and the set of constrains are to be perturbed. At the same time no assumptions of boundedness and smoothness of the operatorA are used. The connection between the parameters of perturbations, which guarantees strong convergence of approximate solutions, is established. It is proved that the existence of the solution to the unperturbed variational inequality is necessary and sufficient condition for convergence of the regularized perturbed inequality solutions.This research was supported in part by the Ministry of Science Grant 3481-1-91 and by the Ministry of Absorption Center for Absorption in Science.     

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

An application of Shoenfield's absoluteness theorem to the theory of uniform distribution

IfC is a Polish probability space, a Borel set whose sectionsW _x ( have measure one and are decreasing , then we show that the set _x W _x has measure one. We give two proofs of this theorem—one in the language of set theory, the other in the language of probability theory, and we apply the theorem to a question on completely uniformly distributed sequences.Supported by DFG grant Ko 490/7-1.