Restart procedures for the conjugate gradient method View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1977-12

AUTHORS

M. J. D. Powell

ABSTRACT

The conjugate gradient method is particularly useful for minimizing functions of very many variables because it does not require the storage of any matrices. However the rate of convergence of the algorithm is only linear unless the iterative procedure is “restarted” occasionally. At present it is usual to restart everyn or (n + 1) iterations, wheren is the number of variables, but it is known that the frequency of restarts should depend on the objective function. Therefore the main purpose of this paper is to provide an algorithm with a restart procedure that takes account of the objective function automatically. Another purpose is to study a multiplying factor that occurs in the definition of the search direction of each iteration. Various expressions for this factor have been proposed and often it does not matter which one is used. However now some reasons are given in favour of one of these expressions. Several numerical examples are reported in support of the conclusions of this paper. More... »

PAGES

241-254

References to SciGraph publications

Identifiers

URI

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

DOI

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

DIMENSIONS

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


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/1402", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Applied Economics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/14", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Economics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "United Kingdom Atomic Energy Authority", 
          "id": "https://www.grid.ac/institutes/grid.9689.e", 
          "name": [
            "A.E.R.E., Harwell, England"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Powell", 
        "givenName": "M. J. D.", 
        "id": "sg:person.014273540065.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014273540065.32"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1093/comjnl/7.2.149", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002056752"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf01580369", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1005266469", 
          "https://doi.org/10.1007/bf01580369"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf01580369", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1005266469", 
          "https://doi.org/10.1007/bf01580369"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/comjnl/6.2.163", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018099115"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1147/rd.164.0431", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1063180231"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1977-12", 
    "datePublishedReg": "1977-12-01", 
    "description": "The conjugate gradient method is particularly useful for minimizing functions of very many variables because it does not require the storage of any matrices. However the rate of convergence of the algorithm is only linear unless the iterative procedure is \u201crestarted\u201d occasionally. At present it is usual to restart everyn or (n + 1) iterations, wheren is the number of variables, but it is known that the frequency of restarts should depend on the objective function. Therefore the main purpose of this paper is to provide an algorithm with a restart procedure that takes account of the objective function automatically. Another purpose is to study a multiplying factor that occurs in the definition of the search direction of each iteration. Various expressions for this factor have been proposed and often it does not matter which one is used. However now some reasons are given in favour of one of these expressions. Several numerical examples are reported in support of the conclusions of this paper.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/bf01593790", 
    "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": "12"
      }
    ], 
    "name": "Restart procedures for the conjugate gradient method", 
    "pagination": "241-254", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "1ea64f5f2f5e310a7434b564c71dc3ef83ef2edec9924675a08da33ebf45409e"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf01593790"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1006434394"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf01593790", 
      "https://app.dimensions.ai/details/publication/pub.1006434394"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T17:35", 
    "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_8672_00000530.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2FBF01593790"
  }
]
 

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/bf01593790'

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/bf01593790'

Turtle is a human-readable linked data format.

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

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

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


 

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

74 TRIPLES      21 PREDICATES      31 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf01593790 schema:about anzsrc-for:14
2 anzsrc-for:1402
3 schema:author Nfe3c34a4ed0e473e8bebad3fec543fef
4 schema:citation sg:pub.10.1007/bf01580369
5 https://doi.org/10.1093/comjnl/6.2.163
6 https://doi.org/10.1093/comjnl/7.2.149
7 https://doi.org/10.1147/rd.164.0431
8 schema:datePublished 1977-12
9 schema:datePublishedReg 1977-12-01
10 schema:description The conjugate gradient method is particularly useful for minimizing functions of very many variables because it does not require the storage of any matrices. However the rate of convergence of the algorithm is only linear unless the iterative procedure is “restarted” occasionally. At present it is usual to restart everyn or (n + 1) iterations, wheren is the number of variables, but it is known that the frequency of restarts should depend on the objective function. Therefore the main purpose of this paper is to provide an algorithm with a restart procedure that takes account of the objective function automatically. Another purpose is to study a multiplying factor that occurs in the definition of the search direction of each iteration. Various expressions for this factor have been proposed and often it does not matter which one is used. However now some reasons are given in favour of one of these expressions. Several numerical examples are reported in support of the conclusions of this paper.
11 schema:genre research_article
12 schema:inLanguage en
13 schema:isAccessibleForFree false
14 schema:isPartOf N089ee97e75e148418e1f002c19d5edd8
15 N348a5648c31f425d9791b3a8c31c7ace
16 sg:journal.1047630
17 schema:name Restart procedures for the conjugate gradient method
18 schema:pagination 241-254
19 schema:productId N1a2010e9231745de83766e192386f1b8
20 N36e9e21b68ef4048b7705cd109614f72
21 N7798ceba9caa41d5b1ff6e93f5ba2b42
22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006434394
23 https://doi.org/10.1007/bf01593790
24 schema:sdDatePublished 2019-04-10T17:35
25 schema:sdLicense https://scigraph.springernature.com/explorer/license/
26 schema:sdPublisher N0e0099014b5246edb2c6f11a28418826
27 schema:url http://link.springer.com/10.1007%2FBF01593790
28 sgo:license sg:explorer/license/
29 sgo:sdDataset articles
30 rdf:type schema:ScholarlyArticle
31 N089ee97e75e148418e1f002c19d5edd8 schema:issueNumber 1
32 rdf:type schema:PublicationIssue
33 N0e0099014b5246edb2c6f11a28418826 schema:name Springer Nature - SN SciGraph project
34 rdf:type schema:Organization
35 N1a2010e9231745de83766e192386f1b8 schema:name readcube_id
36 schema:value 1ea64f5f2f5e310a7434b564c71dc3ef83ef2edec9924675a08da33ebf45409e
37 rdf:type schema:PropertyValue
38 N348a5648c31f425d9791b3a8c31c7ace schema:volumeNumber 12
39 rdf:type schema:PublicationVolume
40 N36e9e21b68ef4048b7705cd109614f72 schema:name doi
41 schema:value 10.1007/bf01593790
42 rdf:type schema:PropertyValue
43 N7798ceba9caa41d5b1ff6e93f5ba2b42 schema:name dimensions_id
44 schema:value pub.1006434394
45 rdf:type schema:PropertyValue
46 Nfe3c34a4ed0e473e8bebad3fec543fef rdf:first sg:person.014273540065.32
47 rdf:rest rdf:nil
48 anzsrc-for:14 schema:inDefinedTermSet anzsrc-for:
49 schema:name Economics
50 rdf:type schema:DefinedTerm
51 anzsrc-for:1402 schema:inDefinedTermSet anzsrc-for:
52 schema:name Applied Economics
53 rdf:type schema:DefinedTerm
54 sg:journal.1047630 schema:issn 0025-5610
55 1436-4646
56 schema:name Mathematical Programming
57 rdf:type schema:Periodical
58 sg:person.014273540065.32 schema:affiliation https://www.grid.ac/institutes/grid.9689.e
59 schema:familyName Powell
60 schema:givenName M. J. D.
61 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014273540065.32
62 rdf:type schema:Person
63 sg:pub.10.1007/bf01580369 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005266469
64 https://doi.org/10.1007/bf01580369
65 rdf:type schema:CreativeWork
66 https://doi.org/10.1093/comjnl/6.2.163 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018099115
67 rdf:type schema:CreativeWork
68 https://doi.org/10.1093/comjnl/7.2.149 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002056752
69 rdf:type schema:CreativeWork
70 https://doi.org/10.1147/rd.164.0431 schema:sameAs https://app.dimensions.ai/details/publication/pub.1063180231
71 rdf:type schema:CreativeWork
72 https://www.grid.ac/institutes/grid.9689.e schema:alternateName United Kingdom Atomic Energy Authority
73 schema:name A.E.R.E., Harwell, England
74 rdf:type schema:Organization
 




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


...