Iterative methods for the split common fixed point problem in Hilbert spaces View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2014-12

AUTHORS

Huanhuan Cui, Fenghui Wang

ABSTRACT

The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed point set. Recently Censor and Segal proposed an efficient algorithm for solving such a problem. However, to employ their algorithm, one needs to know prior information on the norm of the bounded linear operator. In this paper we propose a new algorithm that does not need any prior information of the operator norm, and we establish the weak convergence of the proposed algorithm under some mild assumptions. MSC:47J25, 47J20, 49N45, 65J15. More... »

PAGES

78

References to SciGraph publications

  • 2012-02. Algorithms for the Split Variational Inequality Problem in NUMERICAL ALGORITHMS
  • 1994-09. A multiprojection algorithm using Bregman projections in a product space in NUMERICAL ALGORITHMS
  • 2011-08. Split Monotone Variational Inclusions in JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1186/1687-1812-2014-78

    DOI

    http://dx.doi.org/10.1186/1687-1812-2014-78

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1013175675


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0806", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information Systems", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Luoyang Normal University", 
              "id": "https://www.grid.ac/institutes/grid.440830.b", 
              "name": [
                "Department of Mathematics, Luoyang Normal University, 471022, Luoyang, P.R. China"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Cui", 
            "givenName": "Huanhuan", 
            "id": "sg:person.016204460077.46", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016204460077.46"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Luoyang Normal University", 
              "id": "https://www.grid.ac/institutes/grid.440830.b", 
              "name": [
                "Department of Mathematics, Luoyang Normal University, 471022, Luoyang, P.R. China"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Wang", 
            "givenName": "Fenghui", 
            "id": "sg:person.015366626501.40", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015366626501.40"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1088/0266-5611/18/2/310", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007071485"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.na.2011.03.041", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013883243"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10957-011-9814-6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018318266", 
              "https://doi.org/10.1007/s10957-011-9814-6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.na.2011.03.044", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018828962"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1088/0266-5611/20/1/006", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1026022192"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1088/0266-5611/26/5/055007", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032993907"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1088/0266-5611/26/5/055007", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032993907"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1088/0266-5611/28/8/085004", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1035530125"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf02142692", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045687057", 
              "https://doi.org/10.1007/bf02142692"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf02142692", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045687057", 
              "https://doi.org/10.1007/bf02142692"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s11075-011-9490-5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052842978", 
              "https://doi.org/10.1007/s11075-011-9490-5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1088/0031-9155/51/10/001", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1059026021"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/s0036144593251710", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062877860"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2014-12", 
        "datePublishedReg": "2014-12-01", 
        "description": "The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed point set. Recently Censor and Segal proposed an efficient algorithm for solving such a problem. However, to employ their algorithm, one needs to know prior information on the norm of the bounded linear operator. In this paper we propose a new algorithm that does not need any prior information of the operator norm, and we establish the weak convergence of the proposed algorithm under some mild assumptions. MSC:47J25, 47J20, 49N45, 65J15.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1186/1687-1812-2014-78", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isFundedItemOf": [
          {
            "id": "sg:grant.7194968", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.7182881", 
            "type": "MonetaryGrant"
          }
        ], 
        "isPartOf": [
          {
            "id": "sg:journal.1136165", 
            "issn": [
              "1687-1812", 
              "1687-1820"
            ], 
            "name": "Fixed Point Theory and Applications", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "1", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "2014"
          }
        ], 
        "name": "Iterative methods for the split common fixed point problem in Hilbert spaces", 
        "pagination": "78", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "3ec3cf6e6b1581de66c757e5bebcf6752684825988240c8d9c4e378b2241a799"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1186/1687-1812-2014-78"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1013175675"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1186/1687-1812-2014-78", 
          "https://app.dimensions.ai/details/publication/pub.1013175675"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-10T13:16", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8659_00000511.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1186%2F1687-1812-2014-78"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1186/1687-1812-2014-78'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1186/1687-1812-2014-78'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1186/1687-1812-2014-78'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1186/1687-1812-2014-78'


     

    This table displays all metadata directly associated to this object as RDF triples.

    108 TRIPLES      21 PREDICATES      38 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1186/1687-1812-2014-78 schema:about anzsrc-for:08
    2 anzsrc-for:0806
    3 schema:author Nb40dbfda53874be088c32591f9cf3cf2
    4 schema:citation sg:pub.10.1007/bf02142692
    5 sg:pub.10.1007/s10957-011-9814-6
    6 sg:pub.10.1007/s11075-011-9490-5
    7 https://doi.org/10.1016/j.na.2011.03.041
    8 https://doi.org/10.1016/j.na.2011.03.044
    9 https://doi.org/10.1088/0031-9155/51/10/001
    10 https://doi.org/10.1088/0266-5611/18/2/310
    11 https://doi.org/10.1088/0266-5611/20/1/006
    12 https://doi.org/10.1088/0266-5611/26/5/055007
    13 https://doi.org/10.1088/0266-5611/28/8/085004
    14 https://doi.org/10.1137/s0036144593251710
    15 schema:datePublished 2014-12
    16 schema:datePublishedReg 2014-12-01
    17 schema:description The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed point set. Recently Censor and Segal proposed an efficient algorithm for solving such a problem. However, to employ their algorithm, one needs to know prior information on the norm of the bounded linear operator. In this paper we propose a new algorithm that does not need any prior information of the operator norm, and we establish the weak convergence of the proposed algorithm under some mild assumptions. MSC:47J25, 47J20, 49N45, 65J15.
    18 schema:genre research_article
    19 schema:inLanguage en
    20 schema:isAccessibleForFree true
    21 schema:isPartOf N712d00a0123a4ea5b4357c5efd62f04c
    22 Nd9cc532d2d8b4499a5ccf8a222d87653
    23 sg:journal.1136165
    24 schema:name Iterative methods for the split common fixed point problem in Hilbert spaces
    25 schema:pagination 78
    26 schema:productId N6cf350b2fdcc41a8a5d848aa4f0095ee
    27 N90a20de4d4494334b20087da52f0d4a2
    28 Nf3f50e2af4ba4bc088b80c0c0ba3c3f3
    29 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013175675
    30 https://doi.org/10.1186/1687-1812-2014-78
    31 schema:sdDatePublished 2019-04-10T13:16
    32 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    33 schema:sdPublisher Nabf1431874a64cd7848eec0293b93122
    34 schema:url http://link.springer.com/10.1186%2F1687-1812-2014-78
    35 sgo:license sg:explorer/license/
    36 sgo:sdDataset articles
    37 rdf:type schema:ScholarlyArticle
    38 N5bfe7f51af844483a9e32cfee7160d95 rdf:first sg:person.015366626501.40
    39 rdf:rest rdf:nil
    40 N6cf350b2fdcc41a8a5d848aa4f0095ee schema:name readcube_id
    41 schema:value 3ec3cf6e6b1581de66c757e5bebcf6752684825988240c8d9c4e378b2241a799
    42 rdf:type schema:PropertyValue
    43 N712d00a0123a4ea5b4357c5efd62f04c schema:volumeNumber 2014
    44 rdf:type schema:PublicationVolume
    45 N90a20de4d4494334b20087da52f0d4a2 schema:name dimensions_id
    46 schema:value pub.1013175675
    47 rdf:type schema:PropertyValue
    48 Nabf1431874a64cd7848eec0293b93122 schema:name Springer Nature - SN SciGraph project
    49 rdf:type schema:Organization
    50 Nb40dbfda53874be088c32591f9cf3cf2 rdf:first sg:person.016204460077.46
    51 rdf:rest N5bfe7f51af844483a9e32cfee7160d95
    52 Nd9cc532d2d8b4499a5ccf8a222d87653 schema:issueNumber 1
    53 rdf:type schema:PublicationIssue
    54 Nf3f50e2af4ba4bc088b80c0c0ba3c3f3 schema:name doi
    55 schema:value 10.1186/1687-1812-2014-78
    56 rdf:type schema:PropertyValue
    57 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    58 schema:name Information and Computing Sciences
    59 rdf:type schema:DefinedTerm
    60 anzsrc-for:0806 schema:inDefinedTermSet anzsrc-for:
    61 schema:name Information Systems
    62 rdf:type schema:DefinedTerm
    63 sg:grant.7182881 http://pending.schema.org/fundedItem sg:pub.10.1186/1687-1812-2014-78
    64 rdf:type schema:MonetaryGrant
    65 sg:grant.7194968 http://pending.schema.org/fundedItem sg:pub.10.1186/1687-1812-2014-78
    66 rdf:type schema:MonetaryGrant
    67 sg:journal.1136165 schema:issn 1687-1812
    68 1687-1820
    69 schema:name Fixed Point Theory and Applications
    70 rdf:type schema:Periodical
    71 sg:person.015366626501.40 schema:affiliation https://www.grid.ac/institutes/grid.440830.b
    72 schema:familyName Wang
    73 schema:givenName Fenghui
    74 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015366626501.40
    75 rdf:type schema:Person
    76 sg:person.016204460077.46 schema:affiliation https://www.grid.ac/institutes/grid.440830.b
    77 schema:familyName Cui
    78 schema:givenName Huanhuan
    79 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016204460077.46
    80 rdf:type schema:Person
    81 sg:pub.10.1007/bf02142692 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045687057
    82 https://doi.org/10.1007/bf02142692
    83 rdf:type schema:CreativeWork
    84 sg:pub.10.1007/s10957-011-9814-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018318266
    85 https://doi.org/10.1007/s10957-011-9814-6
    86 rdf:type schema:CreativeWork
    87 sg:pub.10.1007/s11075-011-9490-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052842978
    88 https://doi.org/10.1007/s11075-011-9490-5
    89 rdf:type schema:CreativeWork
    90 https://doi.org/10.1016/j.na.2011.03.041 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013883243
    91 rdf:type schema:CreativeWork
    92 https://doi.org/10.1016/j.na.2011.03.044 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018828962
    93 rdf:type schema:CreativeWork
    94 https://doi.org/10.1088/0031-9155/51/10/001 schema:sameAs https://app.dimensions.ai/details/publication/pub.1059026021
    95 rdf:type schema:CreativeWork
    96 https://doi.org/10.1088/0266-5611/18/2/310 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007071485
    97 rdf:type schema:CreativeWork
    98 https://doi.org/10.1088/0266-5611/20/1/006 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026022192
    99 rdf:type schema:CreativeWork
    100 https://doi.org/10.1088/0266-5611/26/5/055007 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032993907
    101 rdf:type schema:CreativeWork
    102 https://doi.org/10.1088/0266-5611/28/8/085004 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035530125
    103 rdf:type schema:CreativeWork
    104 https://doi.org/10.1137/s0036144593251710 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062877860
    105 rdf:type schema:CreativeWork
    106 https://www.grid.ac/institutes/grid.440830.b schema:alternateName Luoyang Normal University
    107 schema:name Department of Mathematics, Luoyang Normal University, 471022, Luoyang, P.R. China
    108 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...