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.     

Isometries of symmetric operator spaces associated with AFD factors of typeII and symmetric vector-valued spaces

If is a surjective isometry of the separable symmetric operator spaceE(M, ) associated with the approximately finite-dimensional semifinite factorM and if · _E(M,) is not proportional to · _{L 2}, then there exist a unitary operatorUM and a Jordan automorphismJ ofM such that(x)=UJ(x) for allxME(M, ). We characterize also surjective isometries of vector-valued symmetric spacesF((0, 1), E(M, )).Research supported by the Australian Research Council     

Joint convergence of conditional expectations

Let P_n, nIN{0}, be probability measures on a-fieldA; f_n, nIN{0}, be a family of uniformly boundedA-measurable functions andA _n, nIN, be a sequence of sub--fields ofA, increasing or decreasing to the-fieldA _o. It is shown in this paper that the conditional expectations converge in P_o-measure to with k, n, m , if P_n|A, nIN, converges uniformly to P_n|A and f_n, nIN, converges in P_o-measure to f_o.     

On measures integrating all functions of a given vector lattice

LetE be a vector lattice of real-valued functions defined on a setX, and (E):={{f1}:fE}. Among others, it is shown that, under some additional assumptions onE, every measure that integrates all functionsfE is (E)--smooth iffX is (E)-complete. An application of this general result to various topological situations yields some new measure-theoretic characterizations of realcompact, Borel-complete andN-compact spaces, respectively.     

Unramified Kummer extensions of prime power degree

We determine, for which xR^* the Kummer extension K(Pⁿx) is unramified over K, where K is a local field of char. 0 and res.char. p, _pnK, and R is the valuation ring of K. This builds on techniques of Hasse. Actually, a much more general result concerning cyclic Galois extensions of commutative rings is proved.     

On a Property of Subexponential Distributions

Let F be a distribution function (d.f.) on [0, ) with finite first moment m >0. We define the integrated tail distribution function F ₁ of F by F ₁(t)=m^-1 ₀ ^t (1- F(u))du, t0. In this paper, we obtain sufficient conditions under which implications FSF ₁S and F ₁S FS hold, where S is the class of subexponential distributions.     

On improved regularity of weak solutions of some degenerate,Anisotropic elliptic systems

Summary We consider a (possibly) vector-valued function u: R^N, Rⁿ, minimizing the integral , 2-2/(n*1)<p<2, whereD _i u=u/x _i or some more general functional retaining the same behaviour, we prove higher integrability for Du: D₁ u,..., D_n–1 u L^p/(p-1) and D_nu L²; this result allows us to get existence of second weak derivatives: D(D₁ u),...,D(D_n–1u)L² and D(D_n u) L _p.This work has been supported by MURST and GNAFA-CNR.     

A conditional dilatation equation

Summary The following theorem holds true. Theorem. Let X be a normed real vector space of dimension 3 and let k > 0 be a fixed real number. Suppose that f: X X and g: X × X are functions satisfying x – y = k f(x) – f(y) = g(x, y)(x – y) for all x, y X. Then there exist elements and t X such that f(x) = x + t for all x X and such that g(x, y) = for all x, y X with x – y = k.     

Einige Aspekte in der Zuordnungstheorie

Zusammenfassung Gegeben seien endliche MengenX, Y undZ X × Y, Z _x ={y¦(x,y) Z},Z _y ={x¦(x,y) Z}.Man nenntA X (bzw.B Y)zuordenbar, wenn es eine Injektion:A Y (bzw.: B X) mit(x) Z _x (bzw.(y) Z _y ) gibt, und (A, B) mit #A=#B > 0 einZuordnungspaar, wenn eine Bijektionf:A B mitf(x)Z _x B (bzw.f ^–1 (y) Z _y A) existiert. Die Bijektionf heißtZuordnungsplan fürA, B.In der vorliegenden Arbeit werden Fragen nach der Existenz von optimal zuordenbaren Mengen und optimalen Zuordnungspaaren behandelt, wenn man auf den MengenX undY Ordnungen vorgibt, wobei auch Nebenbedingungen berücksichtigt werden. In manchen Fällen lassen sich anhand der Beweise Zuordnungspläne oder ihre Berechnungsvorschrift explizit angeben.Zum Schluß werden die Aussagen an konkreten, dem Bereich der Wirtschaftswissenschaften entnommenen Beispielen erläutert.

---

Summary LetX, Y be finite sets andZ X × Y, Z _x ={y¦(x,y) Z},Z _y ={x¦(x,y)Z}. A X (resp.B Y) is calledassignable if there is an injection: A Y (resp.: B X) with (x) Z _x (resp.(y) Z _y ), (A, B) with #A=#B > 0 anassigned pair if there is a bijection f:A B withf (x) Z _x B (resp.f ^–1(y) Z _y A). The bijectionf is called aplan forA andB.In this paper problems are discussed concerning the existence of optimal assignable sets and optimal assigned pairs ifX andY are totally ordered, additional constraints are also considered. In some cases the proofs give explicit constructions of plans. The results are illustrated by application to problems occurring in Operations Research.

---

---

Diese Arbeit ist mit Unterstützung des Sonderforschungsbereiches 72 an der Universität Bonn entstanden.     

Uniqueness of barbilian domains

W. Leissner has developed a plane geometry over any Z-ring R, in which a point is an element of R×R and a line is a set of the form {(x+ ra, y + rb):r R} where (x,y) R×R and (a,b) is from a Barbilian domain, i.e., a set of unimodular pairs from R×R satisfying certain axioms. In this note we generalize results of W. Benz guaranteeing the uniqueness of Barbilian domains over several classes of commutative rings. The author wishes to thank Gordon Keller and Douglas Costa for fruitful discussions, the referee for his improvements, and the University of Virginia for its hospitality while this work was done.     

Analysis of a class of fractional programming problems

We propose a solution strategy for fractional programming problems of the form max _xx g(x)/ (u(x)), where the function satisfies certain convexity conditions. It is shown that subject to these conditions optimal solutions to this problem can be obtained from the solution of the problem max _xx g(x) + u(x), where is an exogenous parameter. The proposed strategy combines fractional programming andc-programming techniques. A maximal mean-standard deviation ratio problem is solved to illustrate the strategy in action.     

Approximation under an arc length constraint

Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] _b ^a [1 + (p(x)) ²]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.     

Aufeinanderfolgende Elemente in multiplikativen Zahlenmengen

LetM be a multiplicative set with 1M andmnM if and only ifmM,nM for (m,n)=1. It is shown by elementary means that there exists the asymptotic density of the setM(M–1) for every multiplicative setM. The density is positive if and only ifM possesses a positive density and 2M for some . This result is slightly generalized to sums over multiplicative functionsf with |f|1.     

Second-Order Subexponential Sequences and the Asymptotic Behavior of Their De Pril Transform

Suppose that { f(n), n N ₀ } is a sequence of positive real numbers and suppose that the sequence { a(n), n N ₀ } is given by a(0) = 0, and, for n 1, by the convolution equation nf(n) = a* f(n). The resulting sequence is denoted by a(n) = _f (n) and is called the De Pril transform of { f(n), n N ₀ } . In this paper, we consider first- and second-order asymptotic behavior of { _{f (n), n N 0} } for a large class of subexponential sequences { f(n), n N ₀ } . We also discuss some applications.     

Moser-type inequalities in Lorentz spaces

Moser-type estimates for functions whose gradient is in the Lorentz space L(n, q), 1q, are given. Similar results are obtained for solutions uH _inf0 ^sup1 of Au=(f _i ) _{x i} , where A is a linear elliptic second order differential operator and |f|L(n, q), 2q.Work partially supported by MURST (40%).     

The functional equation of multiplicative derivation is superstable on standard operator algebras

LetX be a real or complex infinite dimensional Banach space andA a standard operator algebra onX. Denote byB(X) the algebra of all bounded linear operators onX. Let : _{+ +} be a function with the property lim _t (t)t ^–1=0. Assume that a mappingD:A B(X) satisfies D(AB)–AD(B)–D(A)B<(A B) for all operatorsA, B D (no linearity or continuity ofD is assumed). ThenD is of the formD(A)=AT–TA for someTB(X).This work was supported by the Research Council of Slovenia     

On the abundance of chaotic behavior for generic one-parameter families of maps

In this paper, we want to show the abundance of chaotic systems with absolutely continuous probability measures in the generic regular family with perturbable points. More precisely, we prove that iff _a:I I, a P is a regular family satisfying some conditions described in the next section, then there exists a Borel set P of positive Lebesgue measure such that for everya ,f _a admits an absolutely continuous invariant probability measure w.r.t. the Lebesgue measure. The idea of proof in this paper, as compared with that shown in [1] and [7], follows a similar line.Supported by the NSFC and the National 863 Project.     

Spectral properties of cosine operator functions

LetA be the generator of a cosine functionC _t ,t R in a Banach spaceX; we shall connect the existence and uniqueness of aT-periodic mild solution of the equationu = Au + f with the spectral property 1 (C _T ) and, in caseX is a Hilbert space, also with spectral properties ofA. This research was supported in part by DAAD, West Germany.     

Lexicographic quasiconcave multiobjective programming

Summary Letf _i :A R ben real-valued objective functions on a convex setA -K ^m ,K:=R orC, n, mN. Letg: A R ⁿ be defined by , where for eachxA, (i ₁ (x), ..., i _n (x)) is a permutation of (1, ...,n) such that . In this paper we treat the problem of findingx ^*A such that , wherel-max denotes the lexicographic maximum. If the f_i's are strongly quasiconcave we can reduce the problem stepwise until finally it is in the form of a scalar programming problem. Further, we consider conditions for the existence and uniqueness of a solution and discuss the relationship of the problem to the vector maximum (i.e. Pareto) and maxmin (i.e. Chebychev) problems.

---

Zusammenfassung f _i :AR seienn reellwertige Zielfunktionen über einer konvexen MengeA-K ^m ,K:=R oderC, n, mN. g:AR ⁿ sei definiert durch , wobei für jedesxA (i ₁ (x), ... i _n (x)) eine Permutation von (1, ...,n) derart ist, daß Wir betrachten das Problem, einx ^*A so zu finden, daß , wobeil-max das lexikographische Maximum bedeute. Falls dief _i stark quasikonkav sind, läßt sich das Problem stufenweise reduzieren, bis es schließlich die Gestalt eines skalaren Optimierungsproblems annimmt. Wir geben Existenz- und Eindeutigkeitsbedingungen an und besprechen Zusammenhänge mit dem Vektormaximumproblem (d.h. Pareto-Optimierung) und dem Maxmin-Problem (d.h. Tschebyscheff-Optimierung).

     

Existence theorems for nonlinear evolution inclusions

Summary In this paper we obtain an existence theorem for the abstract Cauchy problem for multivalued differential equations of the form u–^– f(u)+G(u), u(O)=x₀, where ^– f is the Fréchet subdifferential of a functionf defined on an open subset of a real separable Hilbert space H, taking its values in R {+} and G is a multifunction from C([0, T], ) into the nonempty subsets of L²([0, T], H). As an application we obtain an existence theorem for the multivalued perturbed problem x–^– f(x)+F(t, x), x(0)=x₀, where F:[0, T]×(H) is a multifunction satisfying some regularity assumptions.