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/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Mathematics, Faculty of Science, Nakhon Phanom University, Nakhon Phanom, Thailand", 
          "id": "http://www.grid.ac/institutes/grid.449231.9", 
          "name": [
            "Department of Mathematics, Faculty of Science, Nakhon Phanom University, Nakhon Phanom, Thailand"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Yatakoat", 
        "givenName": "Pornsak", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Research Center in Mathematics and Applied Mathematics, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai, Thailand", 
          "id": "http://www.grid.ac/institutes/grid.7132.7", 
          "name": [
            "Data Science Research Center, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai, Thailand", 
            "Research Center in Mathematics and Applied Mathematics, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai, Thailand"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Suantai", 
        "givenName": "Suthep", 
        "id": "sg:person.010451575507.51", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010451575507.51"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Science and Mathematics, Rajamangala University of Technology Isan Surin Campus, Surin, Thailand", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Department of Science and Mathematics, Rajamangala University of Technology Isan Surin Campus, Surin, Thailand"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hanjing", 
        "givenName": "Adisak", 
        "id": "sg:person.013001310372.88", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013001310372.88"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/978-1-4419-9467-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044558790", 
          "https://doi.org/10.1007/978-1-4419-9467-7"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s11117-012-0161-0", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1042877620", 
          "https://doi.org/10.1007/s11117-012-0161-0"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2022-03-17", 
    "datePublishedReg": "2022-03-17", 
    "description": "In this paper, we introduce and study a new accelerated algorithm based on forward\u2013backward and SP-algorithm for solving a convex minimization problem of the sum of two convex and lower semicontinuous functions in a Hilbert space. Under some suitable control conditions, a weak convergence theorem of the proposed algorithm based on a fixed point is established. Moreover, we choose the stepsize of our algorithm which is independent on the Lipschitz constant of the gradient of the objective function by using a linesearch technique, and then a weak convergence result of the proposed algorithm is analyzed. As applications, we apply the proposed algorithm for solving the image restoration problems and compare its convergence behavior with other well-known algorithms in the literature. By our experiment, the algorithms have a higher efficiency than the others.", 
    "genre": "article", 
    "id": "sg:pub.10.1186/s13662-022-03698-5", 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1421475", 
        "issn": [
          "2731-4235"
        ], 
        "name": "Advances in Continuous and Discrete Models", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "2022"
      }
    ], 
    "keywords": [
      "convex minimization problem", 
      "linesearch technique", 
      "minimization problem", 
      "accelerated optimization algorithms", 
      "new accelerated algorithm", 
      "weak convergence theorem", 
      "weak convergence results", 
      "lower semicontinuous functions", 
      "suitable control conditions", 
      "image restoration problems", 
      "Hilbert space", 
      "convergence theorem", 
      "convergence results", 
      "convergence behavior", 
      "semicontinuous functions", 
      "optimization algorithm", 
      "objective function", 
      "accelerated algorithm", 
      "restoration problem", 
      "SP algorithm", 
      "algorithm", 
      "problem", 
      "stepsize", 
      "Lipschitz", 
      "theorem", 
      "convex", 
      "space", 
      "point", 
      "sum", 
      "applications", 
      "function", 
      "high efficiency", 
      "technique", 
      "gradient", 
      "efficiency", 
      "behavior", 
      "conditions", 
      "experiments", 
      "results", 
      "literature", 
      "control condition", 
      "paper"
    ], 
    "name": "On some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications", 
    "pagination": "25", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1146355840"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1186/s13662-022-03698-5"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1186/s13662-022-03698-5", 
      "https://app.dimensions.ai/details/publication/pub.1146355840"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-08-04T17:10", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/article/article_929.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1186/s13662-022-03698-5"
  }
]

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

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

126 TRIPLES      21 PREDICATES      68 URIs      58 LITERALS      6 BLANK NODES