An example of cycling in a feasible point algorithm View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1981-12

AUTHORS

M. J. D. Powell

ABSTRACT

An example shows that, if in Rosen's [4] algorithm for calculating a point that satisfies linear constraints a natural criterion is used to select constraints to delete from active sets, then the algorithm may cycle instead of converging. There are no degeneracies in the example.

PAGES

353-357

Journal

TITLE

Mathematical Programming

ISSUE

1

VOLUME

20

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bf01589358

DOI

http://dx.doi.org/10.1007/bf01589358

DIMENSIONS

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


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", 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Cambridge", 
          "id": "https://www.grid.ac/institutes/grid.5335.0", 
          "name": [
            "DAMTP, University of Cambridge, England"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Powell", 
        "givenName": "M. J. D.", 
        "id": "sg:person.07731545105.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07731545105.07"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1137/0108011", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062837703"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/1007004", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062858363"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1981-12", 
    "datePublishedReg": "1981-12-01", 
    "description": "An example shows that, if in Rosen's [4] algorithm for calculating a point that satisfies linear constraints a natural criterion is used to select constraints to delete from active sets, then the algorithm may cycle instead of converging. There are no degeneracies in the example.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/bf01589358", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1047630", 
        "issn": [
          "0025-5610", 
          "1436-4646"
        ], 
        "name": "Mathematical Programming", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "20"
      }
    ], 
    "name": "An example of cycling in a feasible point algorithm", 
    "pagination": "353-357", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "0bf3207409ad12d2567c2b1cebb39d4d4b15a52409249e9df3ae9ece23fd62a6"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf01589358"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1002510021"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf01589358", 
      "https://app.dimensions.ai/details/publication/pub.1002510021"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T20:50", 
    "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_8684_00000529.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2FBF01589358"
  }
]
 

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.1007/bf01589358'

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.1007/bf01589358'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf01589358'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf01589358'


 

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

59 TRIPLES      20 PREDICATES      27 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf01589358 schema:author Nb60cde6f7fe447649d735421b51d5cea
2 schema:citation https://doi.org/10.1137/0108011
3 https://doi.org/10.1137/1007004
4 schema:datePublished 1981-12
5 schema:datePublishedReg 1981-12-01
6 schema:description An example shows that, if in Rosen's [4] algorithm for calculating a point that satisfies linear constraints a natural criterion is used to select constraints to delete from active sets, then the algorithm may cycle instead of converging. There are no degeneracies in the example.
7 schema:genre research_article
8 schema:inLanguage en
9 schema:isAccessibleForFree false
10 schema:isPartOf N3fd0e484f8b647999e283b0e20a31daf
11 N5c726257344b405b8dc9c4def3625333
12 sg:journal.1047630
13 schema:name An example of cycling in a feasible point algorithm
14 schema:pagination 353-357
15 schema:productId N6ebc9b723731472d8135693715fb8055
16 Nbff71d0ae50c4495930b070ee51e3219
17 Ne5389cd69314427aae347ca014c5a829
18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002510021
19 https://doi.org/10.1007/bf01589358
20 schema:sdDatePublished 2019-04-10T20:50
21 schema:sdLicense https://scigraph.springernature.com/explorer/license/
22 schema:sdPublisher Na1ea0b126fce4a48afdc9bec5796ed0d
23 schema:url http://link.springer.com/10.1007%2FBF01589358
24 sgo:license sg:explorer/license/
25 sgo:sdDataset articles
26 rdf:type schema:ScholarlyArticle
27 N3fd0e484f8b647999e283b0e20a31daf schema:volumeNumber 20
28 rdf:type schema:PublicationVolume
29 N5c726257344b405b8dc9c4def3625333 schema:issueNumber 1
30 rdf:type schema:PublicationIssue
31 N6ebc9b723731472d8135693715fb8055 schema:name doi
32 schema:value 10.1007/bf01589358
33 rdf:type schema:PropertyValue
34 Na1ea0b126fce4a48afdc9bec5796ed0d schema:name Springer Nature - SN SciGraph project
35 rdf:type schema:Organization
36 Nb60cde6f7fe447649d735421b51d5cea rdf:first sg:person.07731545105.07
37 rdf:rest rdf:nil
38 Nbff71d0ae50c4495930b070ee51e3219 schema:name dimensions_id
39 schema:value pub.1002510021
40 rdf:type schema:PropertyValue
41 Ne5389cd69314427aae347ca014c5a829 schema:name readcube_id
42 schema:value 0bf3207409ad12d2567c2b1cebb39d4d4b15a52409249e9df3ae9ece23fd62a6
43 rdf:type schema:PropertyValue
44 sg:journal.1047630 schema:issn 0025-5610
45 1436-4646
46 schema:name Mathematical Programming
47 rdf:type schema:Periodical
48 sg:person.07731545105.07 schema:affiliation https://www.grid.ac/institutes/grid.5335.0
49 schema:familyName Powell
50 schema:givenName M. J. D.
51 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07731545105.07
52 rdf:type schema:Person
53 https://doi.org/10.1137/0108011 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062837703
54 rdf:type schema:CreativeWork
55 https://doi.org/10.1137/1007004 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062858363
56 rdf:type schema:CreativeWork
57 https://www.grid.ac/institutes/grid.5335.0 schema:alternateName University of Cambridge
58 schema:name DAMTP, University of Cambridge, England
59 rdf:type schema:Organization
 




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


...