γ-Subdifferential and γ-convexity of functions on a normed space

In this paper, the -subdifferential is introduced for investigating the global behavior of real-valued functions on a normed spaceX. Iff: DX attains its global minimum onD atx ^*, then 0 f(x ^*). This necessary condition always holds, even iff is not continuous orx ^* is at the boundary of its domain. Nevertheless, it is useful because, by choosing a suitable ₊, many local minima cannot satisfy this necessary condition. For the sufficient conditions, the so-called -convex functions are defined. The class of these functions is rather large. For example, every periodic function on the real line is a -convex function. There are -convex functions which are not continuous everywhere. Every function of bounded variation can be represented as the difference of two -convex functions. For all that, -convex functions still have properties similar to those of convex functions. For instance, each -local minimizer off is at the same time a global one. Iff attains its global minimum onD, then it does so at least at one point of its -boundary.This research was supported by the Alexander von Humboldt Foundation. The author thanks Professors R. Bulirsch, K. H. Hoffmann, and H. G. Bock for inviting him to Munich and Augsburg where this research was done.     

On the Ranked Excursion Heights of a Kiefer Process

Let (K(s,t), 0s1, t1) be a Kiefer process, i.e., a continuous two-parameter centered Gaussian process indexed by [0,1]×₊ whose covariance function is given by (K(s₁,t₁) K(s₂,t₂))=(s₁s₂-s₁s₂)t₁t₂, 0s₁, s₂1, t₁, t₂ 0. For each t>0, the process K(·,t) is a Brownian bridge on the scale of . Let M ₁ ^* (t) M ₂ ^* (t) M _j ^* (t) 0 be the ranked excursion heights of K(,t). In this paper, we study the path properties of the process tM _j ^* (t). Two laws of the iterated logarithm are established to describe the asymptotic behaviors of M _j ^* (t) as t goes to infinity.     

A chord-stretching map of a convex loop is an isometry

Let ⁿ be n-dimensional Euclidean space, and let : [0, L] ⁿ and : [0, L] ⁿ be closed rectifiable arcs in ⁿ of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C ² curves. In this paper we prove the conjecture in general.     

Extension of Subgradient Techniques for Nonsmooth Optimization in Banach Spaces

In this paper we continue the study of the subgradient method for nonsmooth convex constrained minimization problems in a uniformly convex and uniformly smooth Banach space. We consider the case when the stepsizes satisfy _{k=1 k} =, lim _{k k} =0.     

Quasimonotonicity,regularity and duality for nonlinear systems of partial differential equations

Summary We prove partial regularity for the vector-valued differential forms solving the system (A(x, ))=0, d=0, and for the gradient of the vector-valued functions solving the system div A(x, Du)=B(x, u, Du). Here the mapping A, with A(x, w) (1+ + ¦¦²)^{(p – 2)/2} (p2), satisfies a quasimonotonicity condition which, when applied to the gradient A(x, )=Df(x, ) of a real-valued functionf, is analogous to but stronger than quasiconvexity for f. The case 1相似文献   

Primitive Inner Illuminating Systems for Convex Bodies

A set X of boundary points of a (possibly unbounded) convex body KE ^d illuminating K from within is called primitive if no proper subset of X still illuminates K from within. We prove that for such a primitive set X of an unbounded, convex set KE ^d (distinct from a cone) one has X=2 if d=2, X6 if d=3, and that there is no upper bound for X if d4.     

Mathematical programs with a two-dimensional reverse convex constraint

We consider the problem min {f(x): x G, T(x) int D}, where f is a lower semicontinuous function, G a compact, nonempty set in ⁿ, D a closed convex set in ² with nonempty interior and T a continuous mapping from ⁿ to ². The constraint T(x) int D is a reverse convex constraint, so the feasible domain may be disconnected even when f, T are affine and G is a polytope. We show that this problem can be reduced to a quasiconcave minimization problem over a compact convex set in ² and hence can be solved effectively provided f, T are convex and G is convex or discrete. In particular we discuss a reverse convex constraint of the form c, x · d, x1. We also compare the approach in this paper with the parametric approach.     

Positive Solutions for a Singular Nonlinear Problem on a Bounded Domain in R 2

For a bounded regular Jordan domain in R ², we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ^–,>0 with nonnegative functions qK(). Some estimates on the solution are also given.     

Jordan axioms for C*-algebras

A complex Banach spaceA which is also an associative algebra provided with a conjugate linear vector space involution * satisfying (a ²)^*=(a ^*)², aa ^* a=a³ and ab+ba2ab for alla, b inA is shown to be a C^*-algebra. The assumptions onA can be expressed in terms of the Jordan algebra obtained by symmetrization of the product ofA and are satisfied by any C^*-algebra. Thus we obtain a purely Jordan characterization of C^*-algebras.     

Greedy algorithms in Banach spaces

We study efficiency of approximation and convergence of two greedy type algorithms in uniformly smooth Banach spaces. The Weak Chebyshev Greedy Algorithm (WCGA) is defined for an arbitrary dictionary D and provides nonlinear m-term approximation with regard to D. This algorithm is defined inductively with the mth step consisting of two basic substeps: (1) selection of an mth element _m ^c from D, and (2) constructing an m-term approximant G _m ^c . We include the name of Chebyshev in the name of this algorithm because at the substep (2) the approximant G _m ^c is chosen as the best approximant from Span( ₁ ^c ,..., _m ^c ). The term Weak Greedy Algorithm indicates that at each substep (1) we choose _m ^c as an element of D that satisfies some condition which is t _m -times weaker than the condition for _m ^c to be optimal (t _m =1). We got error estimates for Banach spaces with modulus of smoothness (u)u ^q , 1<q2. We proved that for any f from the closure of the convex hull of D the error of m-term approximation by WCGA is of order (1+t ₁ ^p ++t _m ^p )^–1/p , 1/p+1/q=1. Similar results are obtained for Weak Relaxed Greedy Algorithm (WRGA) and its modification. In this case an approximant G ^r _m is a convex linear combination of 0,₁ ^r ,..., ^r _m . We also proved some convergence results for WCGA and WRGA.     

The lyapunov equation and the problem of stability for linear bounded discrete-time systems in Hilbert space

This paper is devoted to a study of the properties of the equationA ^*FA–F=–G, where FL() is unknown, AL(), GL() is positive and is a Hilbert space. It is shown that necessary and sufficient (in some sense) conditions for the existence of positive definite solutions of this equation are directly connected with the stability of infinite dimensional linear systemx _k+1=Ax _k . The relationships between stability of such a system and stability of a continuous-time system generated by a strongly continuous semigroup are given also. As an example the case of the delayed system in Rⁿ is considered.This work was supported in part by the Polish Academy of Sciences under the contract Problem Miedzyresortowy I.1, Grupa Tematyczna 3 This paper was written while the author was with the Instytut Automatyki, the same university.     

Convolution semigroups and central limit theorem associated with a dual convolution structure

We consider hypergroups associated with Jacobi functions ⁽⁾ (x), (–1/2). We prove the existence of a dual convolution structure on [0,+[i(]0,s ₀]{{) =++1,s ₀=min(,–+1). Next we establish a Lévy-Khintchine type formula which permits to characterize the semigroup and the infinitely divisible probabilities associated with this dual convolution, finally we prove a central limit theorem.     

Leaves in Representation Diagrams of Bipartite Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Let ₀ > ₁ ··· > _D denote the eigenvalues of and let q ^h _ij (0 h, i, j D) denote the Krein parameters of . Pick an integer h (1 h D – 1). The representation diagram = _h is an undirected graph with vertices 0,1,...,D. For 0 i, j D, vertices i, j are adjacent in whenever i j and q ^h _ij 0. It turns out that in , the vertex 0 is adjacent to h and no other vertices. Similarly, the vertex D is adjacent to D – h and no other vertices. We call 0, D the trivial vertices of . Let l denote a vertex of . It turns out that l is adjacent to at least one vertex of . We say l is a leaf whenever l is adjacent to exactly one vertex of . We show has a nontrivial leaf if and only if is the disjoint union of two paths.     

A bounded law of the iterated logarithm for Hilbert space valued martingales and its application to U-statistics

Summary A bounded law of the iterated logarithm for martingales with values in a separable Hilbert space H is proved. It is then applied to prove invariance principles for U-statistics for independent identically distributed (-valued) random variables {X _j , j1} and a kernel h: ^m H, m2, which is degenerate for the common distribution function of X _j , j1. This extends to general m results of an earlier paper on this subject and even gives new results in the case H=.     

Efficiency of Proximal Bundle Methods

We give efficiency estimates for proximal bundle methods for finding f_*min_Xf, where f and X are convex. We show that, for any accuracy <0, these methods find a point x^kX such that f(x^k)–f^* after at most k=O(1/³) objective and subgradient evaluations.     

Weak solutions of the Stokes problem in weighted Sobolev spaces

For n2 we consider the Stokes problem in ⁿ, -u + p=f, -divu=g, in weighted Soboiev spaces H ₆ ^m,r , where the weights are proportional to (1+|x|). We prove the existence of weak solutions for any K, whereK is a discrete set of critical values. Furthermore, we characterize the solutions of the homogeneous problem.This research was supported by the DFG research group Equations of Hydrodynamics, Universities of Bayreuth and Paderborn.     

Quasi-coherence of Hardy spaces in several complex variables

In this paper, we prove that the Hardy spaceH ^p (), 1p<, over a strictly pseudoconvex domain in ⁿ with smooth boundary is quasi-coherent. More precisely, we show that Toeplitz tuplesT with suitable symbols onH ^p () have property (). This proof is based on a well known exactness result for the tangential Cauchy-Riemann complex.     

Approximate first-order and second-order directional derivatives of a marginal function in convex optimization

Given a convex functionf: ^p × ^q (–, +], the marginal function is defined on ^p by (x)=inf{f(x, y)|y ^q }. Our purpose in this paper is to express the approximate first-order and second-order directional derivatives of atx ₀ in terms of those off at (x ₀,y ₀), wherey ₀ is any element for which (x ₀)=f(x ₀,y ₀).The author is indebted to one referee for pointing out an inaccuracy in an earlier version of Theorem 4.1.     

Waterman classes and triangular sums of double Fourier series

Let ^a ={nln^a (n+1)}, where a R. The following results are established: For every &fnof ^a BV ((- ]²), the triangular partial sums of its Fourier series are uniformly bounded if a = -1, and converge everywhere if a < -1.For every a>0, there exists &fnof ^a BV ((- ]²) such that the triangular partial sums of its Fourier series are unbounded at the point (0;0).     

Quasianapole Interaction of Charged Fermions

We obtain the analytic expression for the total cross section of the reaction e ^– e ⁺l ^– l ⁺ (l=,) taking possible quasianapole interaction effects into account. We find numerical restrictions on the interaction parameter value from data for the reaction e ^– e ^+–+ in the energy domain below the Z ⁰ peak.