Global Convergence of a Modified Gradient Projection Method for Convex Constrained Problems

In this paper, the continuously differentiable optimization problem min{f（x） ： x∈Ω}, where Ω ∈ R^n is a nonempty closed convex set, the gradient projection method by Calamai and More （Math. Programming, Vol.39. P.93-116, 1987） is modified by memory gradient to improve the convergence rate of the gradient projection method is considered. The convergence of the new method is analyzed without assuming that the iteration sequence {x^k} of bounded. Moreover, it is shown that, when f（x） is pseudo-convex （quasiconvex） function, this new method has strong convergence results. The numerical results show that the method in this paper is more effective than the gradient projection method.     

Asymptotics of Huber-Dutter Estimators for Partial Linear Model with Nonstochastic Designs

For partial linear model Y=X~τβ_0 _(g0)(T) εwith unknown β_0∈R~d and an unknown smooth function go, this paper considers the Huber-Dutter estimators of β_0, scale σfor the errors and the function go respectively, in which the smoothing B-spline function is used. Under some regular conditions, it is shown that the Huber-Dutter estimators of β_0 and σare asymptotically normal with convergence rate n~((-1)/2) and the B-spline Huber-Dutter estimator of go achieves the optimal convergence rate in nonparametric regression. A simulation study demonstrates that the Huber-Dutter estimator of β_0 is competitive with its M-estimator without scale parameter and the ordinary least square estimator. An example is presented after the simulation study.     

Stability of a Cubically Convergent Method for Generalized Equations

In Geoffroy et al, Acceleration of convergence in Dontchev's iterative method for solving variational inclusions Serdica Math. J. 29 (2003), pp. 45–54] we showed the convergence of a cubic method for solving generalized equations of the form 0 ∈ f(x) +- G(x) where f is a function and G stands for a set-valued map. We investigate here the stability of such a method with respect to some perturbations. More precisely, we consider the perturbed equation y ∈ f(x) +- G(x) and we show that the pseudo-Lipschitzness of the map (f +- G)⁻¹ is closely tied to the uniformity of our method in the sense that the attraction region does not depend on small perturbations of the parameter y. Finally, we provide an enhanced version of the convergence theorem established by Geoffroy, et al.     

Stability of Doob—Meyer Decomposition Under Extended Convergence

In what follows, we consider the relation between Aldous‘s extended convergence and weak convergence of filtrations. We prove that, for a sequence (X^n) of Ft^n )-special semimartingales, with canonical decomposition X^n =M^n A^n, if the extended convergence (X^n,F.^n)→(X,T. ) holds with a quasi-left continuous (Ft)-special semimartingale X = M A, then, under an additional assumption of uniform integrability,we get the convergence in probability under the Skorokhod topology: M^n↑P→M and A^n↑P→ A.     

Almost Everywhere Convergence of Fejér Means of <Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript> Functions on Rarely Unbounded Vilenkin Groups

A highly celebrated problem in dyadic harmonic analysis is the pointwise convergence of the Fejér (or (C, 1)) means of functions on unbounded Vilenkin groups. There are several papers of the author of this paper concerning this. That is, we know the a.e. convergence σ _n f → f (n → ∞) for functions f ∈ L ^p , where p > 1 (Journal of Approximation Theory, 101(1), 1–36, (1999)) and also the a.e. convergence σM _n f → f (n → ∞) for functions f ∈ L ¹ (Journal of Approximation Theory, 124(1), 25–43, (2003)). The aim of this paper is to prove the a.e. relation lim _n → σ _n f = f for each integrable function f on any rarely unbounded Vilenkin group. The concept of the rarely unbounded Vilenkin group is discussed in the paper. Basically, it means that the generating sequence m may be an unbounded one, but its "big elements" are not "too dense". Research supported by the Hungarian National Foundation for Scientific Research (OTKA), Grant No. M 36511/2001 and T 048780     

两类统计收敛的表示定理

本文证明了Banach空间X中的序列Δ(Δ~m)-统计收敛表示,以及Banach空间X中的双序列(双序列双-Lacunary)统计收敛的表示.     

ON LAGRANGE INTERPOLATION TO ｜x｜^α（1 〈α 〈 2） WITH EQUALLY SPACED NODES

S.M. Lozinskii proved the exact convergence rate at the zero of Lagrange interpolation polynomials to |x| based on equidistant nodes in [−1,1], In 2000, M. Rever generalized S.M. Lozinskii’s result to |x|^α(0≤α≤1). In this paper we will present the exact rate of convergence at the point zero for the interpolants of |x|^α(1<α<2).     

Kernel regression estimation for continuous spatial processes

We investigate here a kernel estimate of the spatial regression function r(x) = E(Y _u | X _u = x), x ∈ ℝ^d, of a stationary multidimensional spatial process { Z _u = (X _u, Y _u), u ∈ ℝ ^N }. The weak and strong consistency of the estimate is shown under sufficient conditions on the mixing coefficients and the bandwidth, when the process is observed over a rectangular domain of ℝ^N. Special attention is paid to achieve optimal and suroptimal strong rates of convergence. It is also shown that this suroptimal rate is preserved by using a suitable spatial sampling scheme.      

Modified Proximal-Point Algorithm for Maximal Monotone Operators in Banach Spaces

We introduce an iterative sequence for finding the solution to 0∈T(v), where T : E⇉E ^* is a maximal monotone operator in a smooth and uniformly convex Banach space E. This iterative procedure is a combination of iterative algorithms proposed by Kohsaka and Takahashi (Abstr. Appl. Anal. 3:239–249, 2004) and Kamamura, Kohsaka and Takahashi (Set-Valued Anal. 12:417–429, 2004). We prove a strong convergence theorem and a weak convergence theorem under different conditions respectively and give an estimate of the convergence rate of the algorithm. An application to minimization problems is given. This work was partially supported by the National Natural Sciences Grant 10671050 and the Heilongjiang Province Natural Sciences Grant A200607. The authors thank the referees for useful comments improving the presentation and Professor K. Kohsaka for pointing out Ref. 7.     

On some generalizations of Lorentz's almost convergence

We investigate an extension of the almost convergence of G.G. Lorentz, further weakening the notion of M-almost convergence we defined in [S. Mercourakis, G. Vassiliadis, An extension of Lorentz's almost convergence and applications in Banach spaces, Serdica Math. J. 32 (2006) 71–98] and requiring that the means of a bounded sequence restricted on a subset M of converge weakly in ℓ^∞(M). The case when M has density 1 is of special interest and in this case we derive a result in the direction of the Mean Ergodic Theorem (see Theorem 2).     

Rates of uniform convergence for empirical processes of strictly stationary β-mixing sequences indexed by an unbounded class of functions

Assume that {Xn} is a strictly stationary β-mixing random sequence with the β-mixing coefficient βk = O(k-r), 0 < r ≤1. Yu (1994) obtained convergence rates of empirical processes of strictly stationary β-mixing random sequence indexed by bounded classes of functions. Here, a new truncation method is proposed and used to study the convergence for empirical processes of strictly stationary β-mixing sequences indexed by an unbounded class of functions. The research results show that if the envelope of the index class of functions is in Lp, p > 2 or p > 4, uniform convergence rates of empirical processes of strictly stationary β-mixing random sequence over the index classes can reach O((nr/(l+r)/logn)-1/2) or O((nr/(1+r)/ log n)-3/4) and that the Central Limit Theorem does not always hold for the empirical processes.``     

Some remarks on the Dirichlet problem in plane exterior domains

Abstract  In this paper we deal with the Dirichlet problem for the Laplace equation in a plane exterior domain Ω with a Lipschitz boundary. We prove that, if the boundary datum a is square summable, then the problem admits a solution which tends to a in the sense of nontangential convergence, is unique in a suitable function class and vanishes at infinity as r^–k if and only if a satisfies k compatibility conditions, which we are able to explicit when Ω is the exterior of an ellipse. Keywords: Dirichlet problem, Asymptotic behavior, Potential theory Mathematics Subject Classification (2000): 31A05, 31A10     

Some difference sequence spaces defined by a sequence of <Emphasis Type="Italic">ϕ</Emphasis> -functions

Abstract  In this paper, we introduce new difference sequence spaces combining with de la Vallee-Poussin mean using by a sequence of modulus functions and ϕ -functions. We also studied connections between statistically convergence related with this space. Keywords Difference sequence, Modulus function, ϕ -function, De la Vallee-Poussin means, Statistical convergence Mathematics Subject Classification (2000) 46A45, 40F05, 46A80     

Newton-type methods of high order and domains of semilocal and global convergence

We present the geometric construction of some classical iterative methods that have global convergence and “infinite” speed of convergence when they are applied to solve certain nonlinear equations f(t)=0. In particular, for nonlinear equations with the degree of logarithmic convexity of f^′, L_f^′(t)=f^′(t)f^?(t)/f^″(t)², is constant, a family of Newton-type iterative methods of high orders of convergence is constructed. We see that this family of iterations includes the classical iterative methods. The convergence of the family is studied in the real line and the complex plane, and domains of semilocal and global convergence are located.     

Coding of a translation of the two-dimensional torus

Let α be in the two-dimensional torus T ² = R ²/Z ². Assume that the translation map T : x → x + α acts ergodically. We present a symbolic coding of the map T which shares several properties with the Sturmian coding of a one-dimensional translation. The symbolic dynamical system is metrically isomorphic to the geometric dynamical system (T ², T). The coding is of quadratic growth complexity and 2-balanced. Moreover, there is a geometric underpinning, the coding is related to a fundamental domain for the action of Z ² on R ² and also to bounded remainder sets.      

Some notes on densely continuous forms

We consider a special space of set-valued functions (multifunctions), the space of densely continuous forms D(X, Y) between Hausdorff spaces X and Y, defined in [HAMMER, S. T.—McCOY, R. A.: Spaces of densely continuous forms, Set-Valued Anal. 5 (1997), 247–266] and investigated also in [HOLá, L’.: Spaces of densely continuous forms, USCO and minimal USCO maps, Set-Valued Anal. 11 (2003), 133–151]. We show some of its properties, completing the results from the papers [HOLY, D.—VADOVIČ, P.: Densely continuous forms, pointwise topology and cardinal functions, Czechoslovak Math. J. 58(133) (2008), 79–92] and [HOLY, D.—VADOVIČ, P.: Hausdorff graph topology, proximal graph topology and the uniform topology for densely continuous forms and minimal USCO maps, Acta Math. Hungar. 116 (2007), 133–144], in particular concerning the structure of the space of real-valued locally bounded densely continuous forms D _p ^*(X) equipped with the topology of pointwise convergence in the product space of all nonempty-compact-valued multifunctions. The paper also contains a comparison of cardinal functions on D _p ^*(X) and on real-valued continuous functions C _p (X) and a generalization of a sufficient condition for the countable cellularity of D _p ^*(X). This work was supported by Science and Technology Assistance Agency under the contract No. APVT-51-006904 and by the Eco-Net (EGIDE) programme of the Laboratoire de Mathématiques de l’Université de Saint-Etienne (LaMUSE), France.     

Coding of a translation of the two-dimensional torus

Let α be in the two-dimensional torus T ² = R ²/Z ². Assume that the translation map T : x → x + α acts ergodically. We present a symbolic coding of the map T which shares several properties with the Sturmian coding of a one-dimensional translation. The symbolic dynamical system is metrically isomorphic to the geometric dynamical system (T ², T). The coding is of quadratic growth complexity and 2-balanced. Moreover, there is a geometric underpinning, the coding is related to a fundamental domain for the action of Z ² on R ² and also to bounded remainder sets.     

Generating Uniform Random Vectors in Z p k : The General Case

We consider the rate of convergence of the Markov chain X _n+1=A X _n +B _n (mod p), where A is an integer matrix with nonzero eigenvalues, and {B _n } _n is a sequence of independent and identically distributed integer vectors, with support not parallel to a proper subspace of Q ^k invariant under A. If for all eigenvalues λ _i of A, then n=O((ln p)²) steps are sufficient and n=O(ln p) steps are necessary to have X _n sampling from a nearly uniform distribution. Conversely, if A has the eigenvalues λ _i that are roots of positive integer numbers, |λ ₁|=1 and |λ _i |>1 for all , then O(p ²) steps are necessary and sufficient.      

A computational comparison of the first nine members of a determinantal family of root-finding methods

For each natural number m greater than one, and each natural number k less than or equal to m, there exists a root-finding iteration function, B_m^(k) defined as the ratio of two determinants that depend on the first m−k derivatives of the given function. This infinite family is derived in Kalantari (J. Comput. Appl. Math. 126 (2000) 287–318) and its order of convergence is analyzed in Kalantari (BIT 39 (1999) 96–109). In this paper we give a computational study of the first nine root-finding methods. These include Newton, secant, and Halley methods. Our computational results with polynomials of degree up to 30 reveal that for small degree polynomials B_m^(k−1) is more efficient than B_m^(k), but as the degree increases, B_m^(k) becomes more efficient than B_m^(k−1). The most efficient of the nine methods is B₄⁽⁴⁾, having theoretical order of convergence equal to 1.927. Newton's method which is often viewed as the method of choice is in fact the least efficient method.     

Evolution of highly symmetric curves under the shrinking curvature flow

Under the shrinking curvature flow with inner normal velocity V = k^α(α > 1), it is shown that highly symmetric, locally convex initial curves evolve into a point asymptotically like an multi‐circles. The proof relies on a crucial use of Bonnensen inequality for highly symmetric, locally convex curves. Copyright © 2016 John Wiley & Sons, Ltd.