View in EDS

On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems.

Saved in:
Bibliographic Details
Title: On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems.
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. Sep2007, Vol. 38 Issue 1, p27-45. 19p. 5 Charts.
Subjects: Nonlinear programming, Quadratic programming, Algorithms, Mathematical optimization, Mathematical analysis, Mathematics
Abstract: Iterative solvers appear to be very promising in the development of efficient software, based on Interior Point methods, for large-scale nonlinear optimization problems. In this paper we focus on the use of preconditioned iterative techniques to solve the KKT system arising at each iteration of a Potential Reduction method for convex Quadratic Programming. We consider the augmented system approach and analyze the behaviour of the Constraint Preconditioner with the Conjugate Gradient algorithm. Comparisons with a direct solution of the augmented system and with MOSEK show the effectiveness of the iterative approach on large-scale sparse problems. [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: 27656030
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems.
– 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>. Sep2007, Vol. 38 Issue 1, p27-45. 19p. 5 Charts.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Nonlinear+programming%22">Nonlinear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Quadratic+programming%22">Quadratic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+analysis%22">Mathematical analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Iterative solvers appear to be very promising in the development of efficient software, based on Interior Point methods, for large-scale nonlinear optimization problems. In this paper we focus on the use of preconditioned iterative techniques to solve the KKT system arising at each iteration of a Potential Reduction method for convex Quadratic Programming. We consider the augmented system approach and analyze the behaviour of the Constraint Preconditioner with the Conjugate Gradient algorithm. Comparisons with a direct solution of the augmented system and with MOSEK show the effectiveness of the iterative approach on large-scale sparse problems. [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=27656030
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10589-007-9035-y
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 19
        StartPage: 27
    Subjects:
      – SubjectFull: Nonlinear programming
        Type: general
      – SubjectFull: Quadratic programming
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Mathematical optimization
        Type: general
      – SubjectFull: Mathematical analysis
        Type: general
      – SubjectFull: Mathematics
        Type: general
    Titles:
      – TitleFull: On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems.
        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: 09
              Text: Sep2007
              Type: published
              Y: 2007
          Identifiers:
            – Type: issn-print
              Value: 09266003
          Numbering:
            – Type: volume
              Value: 38
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Computational Optimization & Applications
              Type: main
ResultId 1