Halpern type proximal point algorithm of accretive operators (Q412632): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.na.2011.09.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977574923 / rank
 
Normal rank

Revision as of 23:56, 19 March 2024

scientific article
Language Label Description Also known as
English
Halpern type proximal point algorithm of accretive operators
scientific article

    Statements

    Halpern type proximal point algorithm of accretive operators (English)
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    The main objectives of this paper are to employ a new proof technique to prove the strong convergence of \((x_n)\) and \((y_n)\), defined respectively by \[ \begin{aligned} x_{n+1}&=\alpha_nu+\beta_nx_n+(1-\alpha_n-\beta_n)J_{r_n}^A x_n,\\ y_{n+1}&=\beta_ny_n+(1-\beta_n)J_{r_n}^A(\alpha_nu+(1-\alpha_n)y_n),\end{aligned} \] to some zero of an accretive operator \(A\) in a uniformly convex Banach space \(E\) with a uniformly Gâteaux differentiable norm (or with a weakly continuous duality mapping \(J_{\varphi}\)) whenever \((\alpha_n)\) and \((\beta_n)\) are sequences in \((0,1)\) and \((r_n)\subset (0,+\infty)\) satisfying the conditions \[ \lim_{n\rightarrow \infty} \alpha_n=0,\quad \sum_{n=1}^{+\infty} \alpha_n=+\infty,\quad \limsup_{n\rightarrow +\infty} \beta_n<1,\quad \liminf_{n\rightarrow +\infty} r_n>0. \] Editorial remark: See also [\textit{Y.-L. Yu}, ibid., No.~13, 5027--5031 (2012; Zbl 1262.47094)].
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    accretive operator
    0 references
    uniformly convex Banach space
    0 references
    uniformly Gâteaux differentiable norm
    0 references
    weakly continuous duality mapping
    0 references
    0 references