Stopping criteria for inner iterations in inexact potential reduction methods: a computational study.

Saved in:
Bibliographic Details
Title: Stopping criteria for inner iterations in inexact potential reduction methods: a computational study.
Authors: Cafieri, S.1 sonia.cafieri@unina2.it, D'Apuzzo, M.1 marco.dapuzzo@unina2.it, De Simone, V.1 valentina.desimone@unina2.it, Di Serafino, D.1 daniela.diserafino@unina2.it
Source: Computational Optimization & Applications. Mar2007, Vol. 36 Issue 2/3, p165-193. 29p. 7 Charts, 8 Graphs.
Subjects: Iterative methods (Mathematics), Numerical analysis, Quadratic programming, Nonlinear programming, Mathematics, Stochastic convergence
Abstract: We focus on the use of adaptive stopping criteria in iterative methods for KKT systems that arise in Potential Reduction methods for quadratic programming. The aim of these criteria is to relate the accuracy in the solution of the KKT system to the quality of the current iterate, to get computational efficiency. We analyze a stopping criterion deriving from the convergence theory of inexact Potential Reduction methods and investigate the possibility of relaxing it in order to reduce as much as possible the overall computational cost. We also devise computational strategies to face a possible slowdown of convergence when an insufficient accuracy is required. [ABSTRACT FROM AUTHOR]
Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 25339733
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Stopping criteria for inner iterations in inexact potential reduction methods: a computational study.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Cafieri%2C+S%2E%22">Cafieri, S.</searchLink><relatesTo>1</relatesTo><i> sonia.cafieri@unina2.it</i><br /><searchLink fieldCode="AR" term="%22D'Apuzzo%2C+M%2E%22">D'Apuzzo, M.</searchLink><relatesTo>1</relatesTo><i> marco.dapuzzo@unina2.it</i><br /><searchLink fieldCode="AR" term="%22De+Simone%2C+V%2E%22">De Simone, V.</searchLink><relatesTo>1</relatesTo><i> valentina.desimone@unina2.it</i><br /><searchLink fieldCode="AR" term="%22Di+Serafino%2C+D%2E%22">Di Serafino, D.</searchLink><relatesTo>1</relatesTo><i> daniela.diserafino@unina2.it</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computational+Optimization+%26+Applications%22">Computational Optimization & Applications</searchLink>. Mar2007, Vol. 36 Issue 2/3, p165-193. 29p. 7 Charts, 8 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Iterative+methods+%28Mathematics%29%22">Iterative methods (Mathematics)</searchLink><br /><searchLink fieldCode="DE" term="%22Numerical+analysis%22">Numerical analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Quadratic+programming%22">Quadratic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Nonlinear+programming%22">Nonlinear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Stochastic+convergence%22">Stochastic convergence</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We focus on the use of adaptive stopping criteria in iterative methods for KKT systems that arise in Potential Reduction methods for quadratic programming. The aim of these criteria is to relate the accuracy in the solution of the KKT system to the quality of the current iterate, to get computational efficiency. We analyze a stopping criterion deriving from the convergence theory of inexact Potential Reduction methods and investigate the possibility of relaxing it in order to reduce as much as possible the overall computational cost. We also devise computational strategies to face a possible slowdown of convergence when an insufficient accuracy is required. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=25339733
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10589-006-9007-7
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 29
        StartPage: 165
    Subjects:
      – SubjectFull: Iterative methods (Mathematics)
        Type: general
      – SubjectFull: Numerical analysis
        Type: general
      – SubjectFull: Quadratic programming
        Type: general
      – SubjectFull: Nonlinear programming
        Type: general
      – SubjectFull: Mathematics
        Type: general
      – SubjectFull: Stochastic convergence
        Type: general
    Titles:
      – TitleFull: Stopping criteria for inner iterations in inexact potential reduction methods: a computational study.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Cafieri, S.
      – PersonEntity:
          Name:
            NameFull: D'Apuzzo, M.
      – PersonEntity:
          Name:
            NameFull: De Simone, V.
      – PersonEntity:
          Name:
            NameFull: Di Serafino, D.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2007
              Type: published
              Y: 2007
          Identifiers:
            – Type: issn-print
              Value: 09266003
          Numbering:
            – Type: volume
              Value: 36
            – Type: issue
              Value: 2/3
          Titles:
            – TitleFull: Computational Optimization & Applications
              Type: main
ResultId 1