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": "Universit\u00e4t W\u00fcrzburg, W\u00fcrzburg, West Germany", 
          "id": "http://www.grid.ac/institutes/grid.8379.5", 
          "name": [
            "Universit\u00e4t W\u00fcrzburg, W\u00fcrzburg, West Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Stoer", 
        "givenName": "Josef", 
        "id": "sg:person.011465456275.61", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011465456275.61"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/bf00934961", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028552390", 
          "https://doi.org/10.1007/bf00934961"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf00927440", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1016331971", 
          "https://doi.org/10.1007/bf00927440"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf01459951", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1021574216", 
          "https://doi.org/10.1007/bf01459951"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1975-12", 
    "datePublishedReg": "1975-12-01", 
    "description": "This paper presents a local convergence analysis of Broyden's class of rank-2 algorithms for solving unconstrained minimization problems,\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}\n$$h(\\bar x) = \\min h(x)$$\n\\end{document},h \u2208 C1(Rn), assuming that the step-size ai in each iterationxi+1 =xi -\u03b1iHi\u25bdh(xi) is determined by approximate line searches only. Many of these methods including the ones most often used in practice, converge locally at least with R-order,\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}\n$$\\tau  \\geqslant \\sqrt[n]{2}$$\n\\end{document}.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/bf01681353", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1047630", 
        "issn": [
          "0025-5610", 
          "1436-4646"
        ], 
        "name": "Mathematical Programming", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "9"
      }
    ], 
    "keywords": [
      "local convergence analysis", 
      "approximate line search", 
      "convergence analysis", 
      "line search", 
      "Broyden class", 
      "unconstrained minimization", 
      "convergence rate", 
      "minimization algorithm", 
      "algorithm", 
      "class", 
      "minimization", 
      "XI", 
      "one", 
      "search", 
      "analysis", 
      "AI", 
      "rate", 
      "practice", 
      "method", 
      "paper"
    ], 
    "name": "On the convergence rate of imperfect minimization algorithms in Broyden's\u03b2-class", 
    "pagination": "313-335", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1017545953"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf01681353"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf01681353", 
      "https://app.dimensions.ai/details/publication/pub.1017545953"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-06-01T21:57", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/article/article_125.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/bf01681353"
  }
]

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.

90 TRIPLES      22 PREDICATES      49 URIs      38 LITERALS      6 BLANK NODES