一类无Lipschitz假设的非线性算子的带误差的Ishikawa迭代程序

１引言与预备知识 设Ｘ为一实赋范线性空间．Ｘ·是Ｘ的对偶空间,正规对偶映射Ｊ：Ｘ→２Ｘ定义为：其中＜·,·＞表示Ｘ和Ｘ的广义对偶组．由［１］知若Ｘ是一致光滑Ｂａｎａｃｈ空间,则Ｊ（·）单值且在Ｘ的任何有界子集上为一致连续．我们用ｊ（·）表示单值的正规对偶映射． 定义１［２］设Ｋ是Ｘ的一非空子集,算子Ｔ：Ｋ→Ｘ称为是　－强伪压缩的,如果存在一个严格增加函数　,存在使得 定义２［２,３］Ｔ称为　强增生算子的,如果（Ｉ－Ｔ）是　－强伪压缩算子（其中Ｉ是恒等算子）． 若定义１（相应地;定义２）中　（ｔ）＝ｋ…     

赋范空间中Lipschitz Φ-半压缩映象不动点的迭代逼近

设X为赋范线性空间,K为X的非空凸子集,T:K→K为LipschitzΦ-半压缩映象.设{αn}n∞=0和{βn}n∞=0为[0,1]中的实数列且满足一定条件.则Ishikawa迭代序列{xn}n∞=0强收敛于T的唯一不动点.结果完整地回答了周海云提出的公开问题.     

Convergence theorem for the common solution for a finite family of ?-strongly accretive operator equations

The purpose of this paper is to study a strong convergence of multi-step iterative scheme to a common solution for a finite family of uniformly continuous ?-strongly accretive operator equations in an arbitrary Banach space. As a consequence, the strong convergence theorem for the multi-step iterative sequence to a common fixed point for finite family of ?-strongly pseudocontractive mappings is also obtained. The results presented in this paper thus improve and extend the corresponding results of Inchan [6], Kang [8] and [9] and many others.     

关于Banach空间中增生算子方程的迭代法收敛率估计

本文研究Banach空间中增生算子方程的Ishikawa迭代法收敛率估计。本文所得结果在以下方面改进和推广了刘理蔚的结果（Nonlinear Anal.42(2)(2000),271-276):(1)以假设{αn},{βn}在不同区间上独立取值代替刘的假设limn→∞αn=limn→∞βn＝0；（2）以一般的收敛率估计和几何收敛率估计代替刘的收敛率估计||xm=x^*||=O(1/m）。     

q-致光滑Banach空间中非线性φ-强伪压缩映射和强增生映射的Ishikawa迭代过程

在q（≥2）一致光滑的实Banach空间中,研究了一类非Lipschitz,非值域有界的φ－强伪压缩映射和φ－强增生映射的Ishikawa迭代收敛问题,所得结果扩展了该领域目前所有的相关结果,因而在目前更具有一般性和广泛性．     

Φ-强增生映象方程解的具误差迭代序列逼近过程

在任意的实Banach空间中,研究Φ-强增生映象T的方程的解的具误差Ishikawa迭代序列的逼近问题,改进并推广了Chidume CE,Osilike M O中的相关研究结果,使结论更具一般性.     

一致平滑Banach空间中一类非线性算子的Ishikawa迭代序列的收敛定理

使用新的技巧，我们得到了连续强增生算子或连续强伪压缩算子的Ｉｓｈｉｋａｗａ迭代序列的强收敛定理，推广或改进了近期相关的结果．     

关于Ishikawa迭代程序稳定性的注释

在实一致光滑Banach空间中,研究了一类具有值域有界、连续强伪压缩算子和连续强增生算子的Ishikawa迭代程序的稳定性;给出了迭代程序中参数所满足的条件,并证明了迭代过程的收敛性。所得结果改进和扩展近期相关结果,为进一步讨论带误差迭代程序的收敛性提供理论依据。     

Weak and Strong Convergence of Solutions to Accretive Operator Inclusions and Applications

Our purpose in this paper is to approximate solutions of accretive operators in Banach spaces. Motivated by Halpern's iteration and Mann's iteration, we prove weak and strong convergence theorems for resolvents of accretive operators. Using these results, we consider the convex minimization problem of finding a minimizer of a proper lower semicontinuous convex function and the variational problem of finding a solution of a variational inequality.     

Equivalence theorems of the convergence between Ishikawa and Mann iterations with errors for generalized strongly successively Φ-pseudocontractive mappings without Lipschitzian assumptions

In this paper, the equivalence of the strong convergence between the modified Mann and Ishikawa iterations with errors in two different schemes by Xu [Y.G. Xu, Ishikawa and Mann iteration process with errors for nonlinear strongly accretive operator equations, J. Math. Anal. Appl. 224 (1998) 91-101] and Liu [L.S. Liu, Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in Banach spaces, J. Math. Anal. Appl. 194 (1995) 114-125] respectively is proven for the generalized strongly successively Φ-pseudocontractive mappings without Lipschitzian assumption. Our results generalize the recent results of the papers [Zhenyu Huang, F. Bu, The equivalence between the convergence of Ishikawa and Mann iterations with errors for strongly successively pseudocontractive mappings without Lipschitzian assumption, J. Math. Anal. Appl. 325 (1) (2007) 586-594; B.E. Rhoades, S.M. Soltuz, The equivalence between the convergences of Ishikawa and Mann iterations for an asymptotically nonexpansive in the intermediate sense and strongly successively pseudocontractive maps, J. Math. Anal. Appl. 289 (2004) 266-278; B.E. Rhoades, S.M. Soltuz, The equivalence between Mann-Ishikawa iterations and multi-step iteration, Nonlinear Anal. 58 (2004) 219-228] by extending to the most general class of the generalized strongly successively Φ-pseudocontractive mappings and hence improve the corresponding results of all the references given in this paper by providing the equivalence of convergence between all of these iteration schemes for any initial points u₁, x₁ in uniformly smooth Banach spaces.     

基于埃特金加速的改进Landweber迭代正则化方法

为克服Landweber迭代正则化方法在求解大规模不适定问题时收敛速度慢的不足,将埃特金加速技巧与不动点迭代相结合,构建了能快速收敛的改进Landweber迭代正则化方法.数值实验结果表明:改进的迭代正则化方法在稳定求解不适定问题时,能够快速地收敛至问题的最优解,较Landweber迭代正则化方法大大提高了收敛速度.     

解非线性不适定算子方程的一种正则化Newton迭代法

本文探讨一种求解非线性不适定算子方程的正则化Newton迭代法.本文讨论了这种迭代法在一般条件下的收敛性以及其他的一些性质.这种迭代法结合确定迭代次数的残差准则有局部收敛性.     

关于m-增生算子的Ishikawa迭代程序的收敛性与稳定性

在任意的Banach空间的条件下,具误差的Ishikawa迭代程序强收敛到非线性方程x+Tx=f的唯一解并且是几乎稳定的.其结果推广、改进和统一了Zeng和Liu的相关结果.     

Inexact inverse subspace iteration for generalized eigenvalue problems

n this paper, we present an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax=λBx. We first formulate a version of inexact inverse subspace iteration in which the approximation from one step is used as an initial approximation for the next step. We then analyze the convergence property, which relates the accuracy in the inner iteration to the convergence rate of the outer iteration. In particular, the linear convergence property of the inverse subspace iteration is preserved. Numerical examples are given to demonstrate the theoretical results.     

Convergence of Inexact Mann Iterations Generated by Nearly Nonexpansive Sequences and Applications

The Mann iterates behave well for nonexpansive mappings for any initial guess in the domain. Our aim in this article is to extend this method to a broad class of inexact fixed point algorithms generated by nearly nonexpansive sequences in Banach spaces and to locate the weak limit of the iterates by its initial guesses. Due to the inexactness, our algorithms become e?ciently applicable for a wider class of problems. As applications, we give convergence theorems for finding solutions of variational inclusion problems and constrained multiple-sets split feasibility problems. Our results are significant refinements and improvements of the corresponding results in the literature.     

Convergence in norm of modified Krasnoselski-Mann iterations for fixed points of demicontractive mappings

This paper deals with fixed points methods related to the general class of demicontractive mappings (including the well-known classes of nonexpansive and quasi-nonexpansive mappings) in Hilbert spaces. Specifically, we point out some historical aspects concerning the concept of demicontactivity and we investigate a regularized variant of the Krasnoselski-Mann iteration that can be alternatively regarded as a simplified form of the inertial iteration (P-E. Maingé, J. Math. Anal. Appl. 344 (2008) 876-887) with non-constant relaxation factors. These two methods ensure the strong convergence of the generated sequence towards the least norm element of the set of fixed-points of demicontractive mappings. However, for convergence, our method does not require anymore the knowledge of some constant related to the involved demicontractive operator. A new and simpler proof is also proposed for its convergence even when involving non-constant relaxation factors. We point out the simplicity of this algorithm (at least from computational point of view) in comparison with other existing methods. We also present some numerical experiments concerning a convex feasibility problem, experiments that emphasize the characteristics of the considered algorithm comparing with a classical cyclic projection-type iteration.     

A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases

In order to compute the smallest eigenvalue together with an eigenfunction of a self-adjoint elliptic partial differential operator one can use the preconditioned inverse iteration scheme, also called the preconditioned gradient iteration. For this iterative eigensolver estimates on the poorest convergence have been published by several authors. In this paper estimates on the fastest possible convergence are derived. To this end the convergence problem is reformulated as a two-level constrained optimization problem for the Rayleigh quotient. The new convergence estimates reveal a wide range between the fastest possible and the slowest convergence.     

一类非线性算子Ishikawa迭代序列的强收敛定理

使用新的分析技巧,研究了一致光滑Ｂａｎａｃｈ空间中φ 强增生算子方程的解和φ 强伪压缩算子不动点的Ｉｓｈｉｋａｗａ迭代逼近问题,改进和扩展了近期的许多相关结果．     

Approximating Solutions of Maximal Monotone Operators in Hilbert Spaces

Let H be a real Hilbert space and let T: H→2^H be a maximal monotone operator. In this paper, we first introduce two algorithms of approximating solutions of maximal monotone operators. One of them is to generate a strongly convergent sequence with limit vT⁻¹0. The other is to discuss the weak convergence of the proximal point algorithm. Next, using these results, we consider the problem of finding a minimizer of a convex function. Our methods are motivated by Halpern's iteration and Mann's iteration.     

ISHIKAWA TYPE ITERATIVE SEQUENCES WITH ERRORS FOR LIPSCHITZIAN φ-STRONGLY ACCRETIVE OPERATOR EQUATIONS IN ARBITRARY BANACH SPACES

In this paper, we investigate the problem of approximating solutions of the equations of Lipschitzian (?)-strongly accretive operators and fixed points of Lipschitzian (?)-hemicontractive operators by Ishikawa type iterative sequences with errors. Our results unify , improve and extend the results obtained previously by several authors including Li and Liu (Acta Math. Sinica 41 (4)(1998), 845-850), and Osilike (Nonlinear Anal. TMA, 36(1)(1999), 1-9), and also answer completely the. open problems mentioned by Chidume (J. Math. Anal. Appl. 151(2) (1990), 453-461).