On the Use of Constraint Preconditioners in Potential Reduction Methods

##article.authors##

  • Sonia Cafieri
  • Marco D'Apuzzo
  • Valentina De Simone
  • Daniela Di Serafino
  • Gerardo Toraldo

##semicolon##

https://doi.org/10.1685/

##article.abstract##

Preconditioned iterative methods provide an effective alternative to direct methods for the solution of the KKT linear systems arising in Interior Point algorithms, especially when large-scale problems are considered. We analyze the behaviour of a Constraint Preconditioner coupled with Krylov solvers, in a Potential Reduction (PR) framework. We present also adaptive stopping criteria for the inner iterations that relate the accuracy in the solution of the KKT system to the quality of the current PR iterate, to increase the overall computational efficiency. Numerical experiments on a set of large-scale problems show the effectiveness of this approach. [DOI: 10.1685 / CSC06031] About DOI

##submission.downloads##

##submissions.published##

2007-10-01

##issue.issue##

##issue.vol## 1 (2006)

##section.section##

Articles

##submission.license##

Authors who submit to this journal agree to the following terms: a) Authors retain copyright over their work, while allowing the SIMAI to place this accepted work under a Creative Commons Attribution License (CC license), which allows others to freely access, use, and share the work, with an acknowledgement of the work's authorship. b) Authors are able to waive the terms of the CC license and enter into separate, additional contractual arrangements for the non-exclusive distribution and subsequent publication of this work (e.g., publish a revised version in a journal, post it to an institutional repository or publish it in a book). with an acknowledgement of its initial publication on “Communications to SIMAI Congress”. c) In addition, authors are encouraged to post and share their work online (e.g., in institutional repositories or on their website).