217,817 research outputs found

    Martingale transforms and the Hardy-Littlewood-Sobolev inequality for semigroups

    Full text link
    We give a representation of the fractional integral for symmetric Markovian semigroups as the projection of martingale transforms and prove the Hardy-Littlewood-Sobolev(HLS) inequality based on this representation. The proof rests on a new inequality for a fractional Littlewood-Paley gg-function.Comment: 13 page

    Split general quasi-variational inequality problem

    Full text link
    In this paper, we introduce a split general quasi-variational inequality problem which is a natural extension of split variational inequality problem, quasi-variational and variational inequality problems in Hilbert spaces. Using projection method, we propose an iterative algorithm for the split general quasi-variational inequality problem and discuss some its special cases. Further, we discuss the convergence criteria of these iterative algorithms. The results presented in this paper generalize, unify and improve the previously known many results for the quasi-variational and variational inequality problems

    Strong convergence with a modified iterative projection method for hierarchical fixed point problems and variational inequalities

    Full text link
    This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem for a sequene of nearly nonexpansive mappings with respect to a nonexpansive mapping. It is shown that under certain approximate assumptions on the operators and parameters, the modified iterative sequence converges strongly to a common element of the set of the common fixed points of nearly nonexpansive mappings.Also, this point solves some variational inequality. As a special case, this projection method can be used to find the minimum norm solution of the given variational inequality. The results here improve and extend some recent corresponding results of other authors.Comment: 11 page

    Acylindrical actions on projection complexes

    Full text link
    We simplify the construction of projection complexes due to Bestvina-Bromberg-Fujiwara. To do so, we introduce a sharper version of the Behrstock inequality, and show that it can always be enforced. Furthermore, we use the new setup to prove acylindricity results for the action on the projection complexes. We also treat quasi-trees of metric spaces associated to projection complexes, and prove an acylindricity criterion in that context as well

    A hybrid method without extrapolation step for solving variational inequality problems

    Full text link
    In this paper, we introduce a new method for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. The iterative process is based on two well-known projection method and the hybrid (or outer approximation) method. However we do not use an extrapolation step in the projection method. The absence of one projection in our method is explained by slightly different choice of sets in hybrid method. We prove a strong convergence of the sequences generated by our method

    Stability inequalities for projections of convex bodies

    Full text link
    We prove several stability and volume difference inequalities for projections of convex bodies and apply them to prove a hyperplane inequality for surface area of projection bodies

    A Note on the Convex Hull of Finitely Many Projections of Spectrahedra

    Full text link
    A spectrahedron is a set defined by a linear matrix inequality. A projection of a spectrahedron is often called a semidefinitely representable set. We show that the convex hull of a finite union of such projections is again a projection of a spectrahedron. This improves upon the result of Helton and Nie, who prove the same result in the case of bounded sets.Comment: 2 page

    Iterations of the projection body operator and a remark on Petty's conjectured projection inequality

    Full text link
    We prove that if a convex body has absolutely continuous surface area measure, whose density is sufficiently close to the constant, then the sequence {ΠmK}\{\Pi^mK\} of convex bodies converges to the ball with respect to the Banach-Mazur distance, as m→∞m\rightarrow\infty. Here, Π\Pi denotes the projection body operator. Our result allows us to show that the ellipsoid is a local solution to the conjectured inequality of Petty and to improve a related inequality of Lutwak.Comment: 13 page

    Affine vs. Euclidean isoperimetric inequalities

    Full text link
    It is shown that every even, zonal measure on the Euclidean unit sphere gives rise to an isoperimetric inequality for sets of finite perimeter which directly implies the classical Euclidean isoperimetric inequality. The strongest member of this large family of inequalities is shown to be the only affine invariant one among them - the Petty projection inequality. As an application, a family of sharp Sobolev inequalities for functions of bounded variation is obtained, each of which is stronger than the classical Sobolev inequality. Moreover, corresponding families of Lp isoperimetric and Sobolev type inequalities are also established

    Elastic demand dynamic network user equilibrium: Formulation, existence and computation

    Full text link
    This paper is concerned with dynamic user equilibrium with elastic travel demand (E-DUE) when the trip demand matrix is determined endogenously. We present an infinite-dimensional variational inequality (VI) formulation that is equivalent to the conditions defining a continuous-time E-DUE problem. An existence result for this VI is established by applying a fixed-point existence theorem (Browder, 1968) in an extended Hilbert space. We present three algorithms based on the aforementioned VI and its re-expression as a differential variational inequality (DVI): a projection method, a self-adaptive projection method, and a proximal point method. Rigorous convergence results are provided for these methods, which rely on increasingly relaxed notions of generalized monotonicity, namely mixed strongly-weakly monotonicity for the projection method; pseudomonotonicity for the self-adaptive projection method, and quasimonotonicity for the proximal point method. These three algorithms are tested and their solution quality, convergence, and computational efficiency compared. Our convergence results, which transcend the transportation applications studied here, apply to a broad family of infinite-dimensional VIs and DVIs, and are the weakest reported to date.Comment: 32 pages, 6 figures, 2 table
    • …
    corecore