Local properties of algorithms for minimizing nonsmooth composite functions

This paper considers local convergence and rate of convergence results for algorithms for minimizing the composite functionF(x)=f(x)+h(c(x)) wheref andc are smooth buth(c) may be nonsmooth. Local convergence at a second order rate is established for the generalized Gauss—Newton method whenh is convex and globally Lipschitz and the minimizer is strongly unique. Local convergence at a second order rate is established for a generalized Newton method when the minimizer satisfies nondegeneracy, strict complementarity and second order sufficiency conditions. Assuming the minimizer satisfies these conditions, necessary and sufficient conditions for a superlinear rate of convergence for curvature approximating methods are established. Necessary and sufficient conditions for a two-step superlinear rate of convergence are also established when only reduced curvature information is available. All these local convergence and rate of convergence results are directly applicable to nonlinearing programming problems.This work was done while the author was a Research fellow at the Mathematical Sciences Research Centre, Australian National University.     

On conditional weak convergence

In this paper we discuss a number of technical issues associated with conditional weak convergence. The main modes of convergence of conditional probability distributions areuniform, probability, andalmost sure convergence in the conditioning variable. General results regarding conditional convergence are obtained, including details of sufficient conditions for each mode of convergence, and characterization theorems for uniform conditional convergence.     

Necessary and sufficient conditions for the convergence of Orthomin(k) on singular and inconsistent linear systems

Summary. We consider the convergence of Orthomin(k) on singular and inconsistent linear systems. Criteria for the breakdown of Orthomin(k) are discussed and analyzed. Moreover, necessary and sufficient conditions for the convergence of Orthomin(k) for any right hand side are given, and a rate of convergence is provided as well. Finally, numerical experiments are shown to confirm the convergence theorem. Received April 1, 1995 / Revised version received October 1, 1997 / Published online July 12, 2000     

Nonlinear approximation by renormalized trigonometric system

We study the convergence of greedy algorithmwith regard to renormalized trigonometric system. Necessary and sufficient conditions are found for system’s normalization to guarantee almost everywhere convergence, and convergence in L ^p (T) for 1 < p < ∞ of the greedy algorithm, where T is the unit torus. Also the non existence is proved for normalization which guarantees convergence almost everywhere for functions from L ¹(T), or uniform convergence for continuous functions.     

The approximation theory for the p-version finite element method and application to non-linear elliptic PDEs

Approximation theoretic results are obtained for approximation using continuous piecewise polynomials of degree p on meshes of triangular and quadrilateral elements. Estimates for the rate of convergence in Sobolev spaces , are given. The results are applied to estimate the rate of convergence when the p-version finite element method is used to approximate the -Laplacian. It is shown that the rate of convergence of the p-version is always at least that of the h-version (measured in terms of number of degrees of freedom used). If the solution is very smooth then the p-version attains an exponential rate of convergence. If the solution has certain types of singularity, the rate of convergence of the p-version is twice that of the h-version. The analysis generalises the work of Babuska and others to the case . In addition, the approximation theoretic results find immediate application for some types of spectral and spectral element methods. Received August 2, 1995 / Revised version received January 26, 1998     

Local convergence theorems for Newton methods

Affine invariant sufficient conditions are given for two local convergence theorems involving inexact Newton-like methods. The first uses conditions on the first Fréchet-derivative whereas the second theorem employs hypotheses on themth (m ≥ 2 an integer). Radius of convergence as well as rate of convergence results are derived. Results involving superlinear convergence and known to be true for inexact Newton methods are extended here. Moreover, we show that under hypotheses on the mth Fréchet-derivative our radius of convergence can sometimes be larger than the corresponding one in [10]. This allows a wider choice for the initial guess. A numerical example is also provided to show that our radius of convergence is larger than the one in [10].     

Die Limes-Uniformisierbarkeit der Limesräume

Convergence structures (Limitierungen) defined by H. R. Fischer [1] in 1959 anduniform convergence structures (uniforme Limitierungen) introduced by C. H. Cook and H. R. Fischer [2] in 1965 are generalizations of the concepts of topology and uniformity respectively. A convergence structure, induced by some uniform convergence structure, will be called (L)-uniformizable (Limes-uniformisierbar). In this paper a necessary and sufficient condition for (L)-uniformizability of a convergence structure will be given. As a consequence any separated (Hausdorff) convergence structure on a set turns out to be (L)-uniformizable. Also any compatible convergence structure (separated or not) on a group is (L)-uniformizable.     

Reconstruction of Baskakov operators preserving some exponential functions

The present paper deals with a new modification of Baskakov operators in which the functions exp(μt) and exp(2μt), μ>0 are preserved. Approximation properties of the operators are captured, ie, uniform convergence and rate of convergence of the operators in terms of modulus of continuity, approximation behaviors of the operators exponential weighted spaces, and pointwise convergence of the operators by means of the Voronovskaya theorem. Advantages of the operators for some special functions are presented.     

Tauberian conditions for w-almost convergent double sequences

In this paper, we introduce the concept of w-almost convergent sequences. Such a definition is a weak form of almost convergent sequences given by G. G. Lorentz in [Acta Math. 80(1948),167-190]. We give a detailed study on w-almost convergent double sequences and prove that w-almost convergence and almost convergence are equivalent under the boundedness of the given sequence. The Tauberian results for w-almost convergence are established. Our Tauberian results generalize a result of Lorentz and Tauber’s second theorem. Moreover, we prove that w-almost convergence and norm convergence are equivalent for the sequence of the rectangular partial sums of the Fourier series of f ∈ L^p(T²), where 1 < p < ∞.      

Convergence analysis of the general Gauss-Newton algorithm

Summary The convergence of the Gauss-Newton algorithm for solving discrete nonlinear approximation problems is analyzed for general norms and families of functions. Aquantitative global convergence theorem and several theorems on the rate of local convergence are derived. A general stepsize control procedure and two regularization principles are incorporated. Examples indicate the limits of the convergence theorems.     

Some variations of the Bohman–Korovkin theorem

In this paper we develop the main aspects of the Bohman–Korovkin theorem on approximation of continuous functions with the use of A-statistical convergence and matrix summability method which includes both convergence and almost convergence. Since statistical convergence and almost convergence methods are incompatible we conclude that these methods can be used alternatively to get some approximation results.     

Stability and convergence of the mark and cell finite difference scheme for Darcy‐Stokes‐Brinkman equations on non‐uniform grids

In this paper, we consider the mark and cell (MAC) method for Darcy‐Stokes‐Brinkman equations and analyze the stability and convergence of the method on nonuniform grids. Firstly, to obtain the stability for both velocity and pressure, we establish the discrete inf‐sup condition. Then we introduce an auxiliary function depending on the velocity and discretizing parameters to analyze the super‐convergence. Finally, we obtain the second‐order convergence in L2 norm for both velocity and pressure for the MAC scheme, when the perturbation parameter ? is not approaching 0. We also obtain the second‐order convergence for some terms of ∥·∥_? norm of the velocity, and the other terms of ∥·∥_? norm are second‐order convergence on uniform grid. Numerical experiments are carried out to verify the theoretical results.     

Numerical Solutions of Stochastic Differential Delay Equations with Jumps

Abstract

In this article, we investigate the strong convergence of the Euler–Maruyama method and stochastic theta method for stochastic differential delay equations with jumps. Under a global Lipschitz condition, we not only prove the strong convergence, but also obtain the rate of convergence. We show strong convergence under a local Lipschitz condition and a linear growth condition. Moreover, it is the first time that we obtain the rate of the strong convergence under a local Lipschitz condition and a linear growth condition, i.e., if the local Lipschitz constants for balls of radius R are supposed to grow not faster than log R.     

Convergence of the Multigrid Method of Ill-conditioned Block Toeplitz Systems

We study the solutions of block Toeplitz systems A _mn u = b by the multigrid method (MGM). Here the block Toeplitz matrices A _mn are generated by a nonnegative function f (x,y) with zeros. Since the matrices A _mn are ill-conditioned, the convergence factor of classical iterative methods will approach 1 as the size of the matrices becomes large. These classical methods, therefore, are not applicable for solving ill-conditioned systems. The MGM is then proposed in this paper. For a class of block Toeplitz matrices, we show that the convergence factor of the two-grid method (TGM) is uniformly bounded below 1 independent of mn and the full MGM has convergence factor depending only on the number of levels. The cost per iteration for the MGM is of O(mn log mn) operations. Numerical results are given to explain the convergence rate.     

Two algorithms for two-phase Stefan type problems

In this paper,the relaxation algorithm and two Uzawa type algorithms for solving discretized variational inequalities arising from the two-phase Stefan type problem are proposed.An analysis of their convergence is presented and the upper bounds of the convergence rates are derived.Some numerical experiments are shown to demonstrate that for the second Uzawa algorithm which is an improved version of the first Uzawa algorithm,the convergence rate is uniformly bounded away from 1 if τh^-2 is kept bounded,where τ is the time step size and h the space mesh size.     

Robust nonparametric estimators of monotone boundaries

This paper revisits some asymptotic properties of the robust nonparametric estimators of order-m and order-α quantile frontiers and proposes isotonized version of these estimators. Previous convergence properties of the order-m frontier are extended (from weak uniform convergence to complete uniform convergence). Complete uniform convergence of the order-m (and of the quantile order-α) nonparametric estimators to the boundary is also established, for an appropriate choice of m (and of α, respectively) as a function of the sample size. The new isotonized estimators share the asymptotic properties of the original ones and a simulated example shows, as expected, that these new versions are even more robust than the original estimators. The procedure is also illustrated through a real data set.     

Sobolev and strict continuity of general hysteresis operators

The most natural and important topologies connected with hysteresis operators are those induced by uniform convergence, W^{1, 1}‐convergence, and strict convergence. Indeed the supremum norm and the variation are invariant under reparameterization. We prove a general result that implies that if a hysteresis operator is continuous with respect to the topology of W^{1, 1}, then it is continuous with respect to the strict topology. Copyright © 2009 John Wiley & Sons, Ltd.     

Iterative minimization of the Rayleigh quotient by block steepest descent iterations

The topic of this paper is the convergence analysis of subspace gradient iterations for the simultaneous computation of a few of the smallest eigenvalues plus eigenvectors of a symmetric and positive definite matrix pair (A,M). The methods are based on subspace iterations for A ^{? 1}M and use the Rayleigh‐Ritz procedure for convergence acceleration. New sharp convergence estimates are proved by generalizing estimates, which have been presented for vectorial steepest descent iterations (see SIAM J. Matrix Anal. Appl., 32(2):443‐456, 2011). Copyright © 2013 John Wiley & Sons, Ltd.     

Two-scale convergence of some integral functionals

Nguetseng’s notion of two-scale convergence is reviewed, and some related properties of integral functionals are derived. The coupling of two-scale convergence with convexity and monotonicity is then investigated, and a two-scale version is provided for compactness by strict convexity. The div-curl lemma of Murat and Tartar is also extended to two-scale convergence, and applications are outlined.     

PreT 2 Objects in Topological Categories

In previous papers, two notions of pre-Hausdorff (PreT ₂) objects in a topological category were introduced and compared. The main objective of this paper is to show that the full subcategory of PreT ₂ objects is a topological category and all of T ₀, T ₁, and T ₂ objects in this topological category are equivalent. Furthermore, the characterizations of pre-Hausdorff objects in the categories of filter convergence spaces, (constant) local filter convergence spaces, and (constant) stack convergence spaces are given and as a consequence, it is shown that these categories are homotopically trivial.