Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    Strong convergence of a km iterative algorithm for computing a split common fixed-point of quasi-nonexpansive operators

    91254.pdf (246.9Kb)
    Access Status
    Open access
    Authors
    Dang, Y.
    Rodrigues, B.
    Sun, Jie
    Date
    2021
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Dang, Y. and Rodrigues, B. and Sun, J. 2021. Strong convergence of a km iterative algorithm for computing a split common fixed-point of quasi-nonexpansive operators. Journal of Nonlinear and Convex Analysis. 22 (5): pp. 969-978.
    Source Title
    Journal of Nonlinear and Convex Analysis
    Additional URLs
    http://yokohamapublishers.jp/online2/opjnca/vol22/p969.html
    ISSN
    1345-4773
    Faculty
    Faculty of Science and Engineering
    School
    School of Elec Eng, Comp and Math Sci (EECMS)
    URI
    http://hdl.handle.net/20.500.11937/91430
    Collection
    • Curtin Research Publications
    Abstract

    A modified Krasnoselski-Mann iterative algorithm is proposed for solving the split common fixed-point problem for quasi-nonexpansive operators. A parameter sequence is introduced to enhance convergence. It is shown that the proposed iterative algorithm strongly converges to a split common fixed-point in Hilbert spaces. This result extends the applicability of the KM algorithm.

    Related items

    Showing items related by title, author, creator and subject.

    • Adaptive antenna array beamforming using a concatenation of recursive least square and least mean square algorithms
      Srar, Jalal Abdulsayed (2011)
      In recent years, adaptive or smart antennas have become a key component for various wireless applications, such as radar, sonar and cellular mobile communications including worldwide interoperability for microwave ...
    • A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
      Qian, X.; Liao, L.; Sun, Jie (2018)
      The affine scaling algorithm is one of the earliest interior point methods developed for linear programming. This algorithm is simple and elegant in terms of its geometric interpretation, but it is notoriously difficult ...
    • Explicit iterative algorithms for solving coupled discrete-time Lyapunov matrix equations
      Sun, H.; Liu, Wan-Quan; Teng, Y. (2016)
      © The Institution of Engineering and Technology 2016.In this study, the authors aim to study explicit iterative algorithms for solving coupled discrete-time Lyapunov matrix equations. First, an explicit iterative algorithm ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.