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/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0103", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Numerical and Computational Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Institut f\u00fcr Angewandte Mathematik and Statistik, Am Hubland, 8700, W\u00fcrzburg, F.R.G.", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Institut f\u00fcr Angewandte Mathematik and Statistik, Am Hubland, 8700, W\u00fcrzburg, F.R.G."
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jarre", 
        "givenName": "F.", 
        "type": "Person"
      }
    ], 
    "datePublished": "1989", 
    "datePublishedReg": "1989-01-01", 
    "description": "We give a complexity analysis concerning the global convergence of the method of analytic centers for solving generalized smooth convex programs. We prove that the analytic center of the feasible set provides a two-sided ellipsoidal approximation of this set, whose tightness, as well as the global rate of convergence of the algorithm, only depends on the number of constraints and on a relative Lipschitz constant of the Hessian matrices of the constraint functions, but not on the data of the constraint functions. This work extends the results in [5] where the solution of problems with convex quadratic constraint functions has been discussed.", 
    "editor": [
      {
        "familyName": "Dolecki", 
        "givenName": "Szymon", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/bfb0083587", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-51970-6"
      ], 
      "name": "Optimization", 
      "type": "Book"
    }, 
    "keywords": [
      "smooth convex programs", 
      "analytic center", 
      "constraint functions", 
      "convex program", 
      "solution of problems", 
      "number of constraints", 
      "ellipsoidal approximation", 
      "global convergence", 
      "Hessian matrix", 
      "feasible set", 
      "complexity analysis", 
      "convergence", 
      "Lipschitz", 
      "approximation", 
      "set", 
      "function", 
      "algorithm", 
      "constraints", 
      "problem", 
      "solution", 
      "matrix", 
      "tightness", 
      "number", 
      "global rate", 
      "work", 
      "results", 
      "center", 
      "analysis", 
      "data", 
      "program", 
      "rate", 
      "method"
    ], 
    "name": "On the method of analytic centers for solving smooth convex programs", 
    "pagination": "69-85", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1048822435"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bfb0083587"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/bfb0083587", 
      "https://app.dimensions.ai/details/publication/pub.1048822435"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-08-04T17:14", 
    "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/chapter/chapter_129.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/bfb0083587"
  }
]

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.

89 TRIPLES      22 PREDICATES      57 URIs      50 LITERALS      7 BLANK NODES