Strong Convergence of Iterative Algorithms for Variational Inequalities in Banach Spaces

Let C be a nonempty closed convex subset of a Banach space E with the dual E ^*, let T:C→E ^* be a Lipschitz continuous mapping and let S:C→C be a relatively nonexpansive mapping. In this paper, by employing the notion of generalized projection operator, we study the following variational inequality (for short, VI(T−f,C)): find x∈C such that

Some Exponential Inequalities for Positively Associated Random Variables and Rates of Convergence of the Strong Law of Large Numbers

We present some exponential inequalities for positively associated unbounded random variables. By these inequalities, we obtain the rate of convergence n ^−1/2 β _n log ^3/2 n in which β _n can be particularly taken as (log log n)^1/σ with any σ>2 for the case of geometrically decreasing covariances, which is faster than the corresponding one n ^−1/2(log log n)^1/2log ² n obtained by Xing, Yang, and Liu in J. Inequal. Appl., doi: (2008) for the case mentioned above, and derive the convergence rate n ^−1/2 β _n log ^1/2 n for the above β _n under the given covariance function, which improves the relevant one n ^−1/2(log log n)^1/2log n obtained by Yang and Chen in Sci. China, Ser. A 49(1), 78–85 (2006) for associated uniformly bounded random variables. In addition, some moment inequalities are given to prove the main results, which extend and improve some known results.     

A Refinement of the Kolmogorov–Marcinkiewicz–Zygmund Strong Law of Large Numbers

Let {X _n ; n≥1} be a sequence of independent copies of a real-valued random variable X and set S _n =X ₁+???+X _n , n≥1. This paper is devoted to a refinement of the classical Kolmogorov–Marcinkiewicz–Zygmund strong law of large numbers. We show that for 0<p<2,

$\sum_{n=1}^{\infty}\frac{1}{n}\biggl(\frac{|S_{n}|}{n^{1/p}}\biggr)<\infty\quad \mbox{almost surely}$

if and only if

$\begin{cases}\mathbb{E}|X|^{p}<\infty &; \mbox{if }0 < p < 1,\\\mathbb{E}X=0,\ \sum_{n=1}^{\infty}\frac{|\mathbb{E}XI\{|X|\leq n\}|}{n}<\infty,\mbox{ and }\\\sum_{n=1}^{\infty}\frac{\int_{\min\{u_{n},n\}}^{n}\mathbb{P}(|X|>t)\,dt}{n}<\infty &; \mbox{if }p = 1,\\\mathbb{E}X=0\mbox{ and }\int_{0}^{\infty}\mathbb{P}^{1/p}(|X|>t)\,dt<\infty,&;\mbox{if }1 < p < 2,\end{cases}$

where \(u_{n}=\inf \{t:~\mathbb{P}(|X|>t)<\frac{1}{n}\}\), n≥1. Versions of the above result in a Banach space setting are also presented. To establish these results, we invoke the remarkable Hoffmann-Jørgensen (Stud. Math. 52:159–186, 1974) inequality to obtain some general results for sums of the form \(\sum_{n=1}^{\infty}a_{n}\|\sum_{i=1}^{n}V_{i}\|\) (where {V _n ; n≥1} is a sequence of independent Banach-space-valued random variables, and a _n ≥0, n≥1), which may be of independent interest, but which we apply to \(\sum_{n=1}^{\infty}\frac{1}{n}(\frac{|S_{n}|}{n^{1/p}})\).

     

New Logics for Quantum Non-individuals?

According to a very widespread interpretation of the metaphysical nature of quantum entities—the so-called Received View on quantum non-individuality—, quantum entities are non-individuals. Still according to this understanding, non-individuals are entities for which identity is restricted or else does not apply at all. As a consequence, it is said, such approach to quantum mechanics would require that classical logic be revised, given that it is somehow committed with the unrestricted validity of identity. In this paper we examine the arguments to the inadequacy of classical logic to deal with non-individuals, as previously defined, and argue that they fail to make a good case for logical revision. In fact, classical logic may accommodate non-individuals in that specific sense too. What is more pressing for the Received View, it seems, is not a revision of logic, but rather a more adequate metaphysical characterization of non-individuals.     

On Cone Characterizations of Strong and Lexicographic Optimality in Convex Multiobjective Optimization

Various type of optimal solutions of multiobjective optimization problems can be characterized by means of different cones. Provided the partial objectives are convex, we derive necessary and sufficient geometrical optimality conditions for strongly efficient and lexicographically optimal solutions by using the contingent, feasible and normal cones. Combining new results with previously known ones, we derive two general schemes reflecting the structural properties and the interconnections of five optimality principles: weak and proper Pareto optimality, efficiency and strong efficiency as well as lexicographic optimality.     

Strong Convergence of an Iterative Scheme by a New Type of Projection Method for a Family of Quasinonexpansive Mappings

We deal with a common fixed point problem for a family of quasinonexpansive mappings defined on a Hilbert space with a certain closedness assumption and obtain strongly convergent iterative sequences to a solution to this problem. We propose a new type of iterative scheme for this problem. A feature of this scheme is that we do not use any projections, which in general creates some difficulties in practical calculation of the iterative sequence. We also prove a strong convergence theorem by the shrinking projection method for a family of such mappings. These results can be applied to common zero point problems for families of monotone operators.     

Lower Bounds for Dimensions of Sums of Sets

We study lower bounds for the Minkowski and Hausdorff dimensions of the algebraic sum E+K of two sets E,K⊂ℝ ^d .     

On the Existence of Optimal Unions of Subspaces for Data Modeling and Clustering

Given a set of vectors F={f ₁,…,f _m } in a Hilbert space H\mathcal {H}, and given a family C\mathcal {C} of closed subspaces of H\mathcal {H}, the subspace clustering problem consists in finding a union of subspaces in C\mathcal {C} that best approximates (is nearest to) the data F. This problem has applications to and connections with many areas of mathematics, computer science and engineering, such as Generalized Principal Component Analysis (GPCA), learning theory, compressed sensing, and sampling with finite rate of innovation. In this paper, we characterize families of subspaces C\mathcal {C} for which such a best approximation exists. In finite dimensions the characterization is in terms of the convex hull of an augmented set C⁺\mathcal {C}^{+}. In infinite dimensions, however, the characterization is in terms of a new but related notion; that of contact half-spaces. As an application, the existence of best approximations from π(G)-invariant families C\mathcal {C} of unitary representations of Abelian groups is derived.     

Strong Laws of Large Numbers for Weighted Sums of Ч-mixing Sequence

In this paper, strong laws of large numbers for weighted sums of Ч-mixing sequence are investigated. Our results extend the corresponding results for negatively associated sequence to the case of Ч-mixing sequence.     

Natural Deduction for Fitting’s Four-Valued Generalizations of Kleene’s Logics

In this paper, we present sound and complete natural deduction systems for Fitting’s four-valued generalizations of Kleene’s three-valued regular logics.     

Inexact Josephy–Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization

We propose and analyze a perturbed version of the classical Josephy–Newton method for solving generalized equations. This perturbed framework is convenient to treat in a unified way standard sequential quadratic programming, its stabilized version, sequential quadratically constrained quadratic programming, and linearly constrained Lagrangian methods. For the linearly constrained Lagrangian methods, in particular, we obtain superlinear convergence under the second-order sufficient optimality condition and the strict Mangasarian–Fromovitz constraint qualification, while previous results in the literature assume (in addition to second-order sufficiency) the stronger linear independence constraint qualification as well as the strict complementarity condition. For the sequential quadratically constrained quadratic programming methods, we prove primal-dual superlinear/quadratic convergence under the same assumptions as above, which also gives a new result.     

Isochronicity at infinity for a class of polynomial differential system

In this paper, we explore the problem of isochronicity at infinity for a class of polynomial differential system. The technique is based on taking infinity into the origin by means of a homeomorphism. Simultaneously, we derive a recursive algorithm to compute period constants at the origin of the transformed system. At the end, as an application of our algorithm, we study pseudo-isochronous center conditions at infinity for a class of septic system.     

Strong Law of Large Numbers for Cosine Weighted Partial Sums of Random Fields

ＳｔｒｏｎｇＬａｗｏｆＬａｒｇｅＮｕｍｂｅｒｓｆｏｒＣｏｓｉｎｅＷｅｉｇｈｔｅｄＰａｒｔｉａｌＳｕｍｓｏｆＲａｎｄｏｍＦｉｅｌｄｓ￥（何书元）ＨｅＳｈｕｙｕａｎ（ＤｅｐａｒｔｍｅｎｔｏｆＰｒｏｂａｂｉｌｉｔｙａｎｄＳｔａｔｉｓｔｉｃｓ，ＰｅｋｉｎｇＵ...     

The Strong Law of Large Numbers for ■-Mixing Random Variables

In this paper we present some results for the general strong laws of large numbers of ■-mixing random variables by a maximal inequality of Utev and Peligrad.These results extend and improve the related known works in the literature.     

Strong Laws and Summability for φ-Mixing Sequences of Random Variables

In this note the almost sure convergence of stationary, -mixing sequences of random variables according to summability methods is linked to the fulfillment of a certain integrability condition generalizing and extending the results for i.i.d. sequences. Furthermore we give via Baum-Katz type results an estimate for the rate of convergence in these laws.     

A Strong Maximum Principle for a Family of Singular Hyperbolic Operators

1.Introduction The maximum principle for the Laplace operator states that if a smoothfunction u satisfies the differential inequality     

Continuity of Weak Solutions for Quasilinear Parabolic Equations with Strong Degeneracy

The aim of this paper is to study the continuity of weak solutions for quasilinear degenerate parabolic equations of the form U_t-Δφ(u)=O, whereφ■C~1(R~1)is a strictly monotone increasing function.Clearly,the above equation has strong degeneracy,i.e.,the set of zero points ofφ′(·)is permitted to have zero measure. This is an answer to an open problem in[13,p.288].     

Martingale Approximation and Optimality of Some Conditions for the Central Limit Theorem

Let (X _i ) be a stationary and ergodic Markov chain with kernel Q and f an L ² function on its state space. If Q is a normal operator and f=(I?Q)^1/2 g (which is equivalent to the convergence of \(\sum_{n=1}^{\infty}\frac{\sum_{k=0}^{n-1}Q^{k}f}{n^{3/2}}\) in L ²), we have the central limit theorem [cf. (Derriennic and Lin in C.R. Acad. Sci. Paris, Sér. I 323:1053–1057, 1996; Gordin and Lif?ic in Third Vilnius conference on probability and statistics, vol. 1, pp. 147–148, 1981)]. Without assuming normality of Q, the CLT is implied by the convergence of \(\sum_{n=1}^{\infty}\frac{\|\sum_{k=0}^{n-1}Q^{k}f\|_{2}}{n^{3/2}}\), in particular by \(\|\sum_{k=0}^{n-1}Q^{k}f\|_{2}=o(\sqrt{n}/\log^{q}n)\), q>1 by Maxwell and Woodroofe (Ann. Probab. 28:713–724, 2000) and Wu and Woodroofe (Ann. Probab. 32:1674–1690, 2004), respectively. We show that if Q is not normal and f∈(I?Q)^1/2 L ², or if the conditions of Maxwell and Woodroofe or of Wu and Woodroofe are weakened to \(\sum_{n=1}^{\infty}c_{n}\frac{\|\sum_{k=0}^{n-1}Q^{k}f\|_{2}}{n^{3/2}}<\infty\) for some sequence c _n ↘0, or by \(\|\sum_{k=0}^{n-1}Q^{k}f\|_{2}=O(\sqrt{n}/\log n)\), the CLT need not hold.     

The Strong Law of Large Numbers for Kaplan–Meier U-Statistics

We introduce a Kaplan–Meier U-statistic of degree two for randomly censored data and prove a strong law for it. We use the technique of Stute and Wang⁽³⁾ by identifying appropriate reverse-time supermartingale processes. This approach avoids the stringent assumptions of Gijbels and Veraverbeke⁽¹⁾ who consider similar functionals.