Recycling basic columns of the splitting preconditioner in interior point methods
Cecilia Orellana Castro (),
Manolo Rodriguez Heredia () and
Aurelio R. L. Oliveira ()
Additional contact information
Cecilia Orellana Castro: Federal University of Southern and Southeastern Pará
Manolo Rodriguez Heredia: Federal University of Southern and Southeastern Pará
Aurelio R. L. Oliveira: University of Campinas
Computational Optimization and Applications, 2023, vol. 86, issue 1, No 2, 49-78
Abstract:
Abstract Theoretical results and numerical experiments show that the linear systems originating from the last iterations of interior point methods (IPM) are very ill-conditioned. For this reason, preconditioners are necessary to approach this problem. In addition to that, in large-scale problems, the use of iterative methods and implicit preconditioners is essential because we only compute matrix–vector multiplications. Preconditioners with a lower computational cost than the splitting preconditioner only have good performance in the initial iterations of the IPM, so this preconditioner has become very important in the last iterations. The study of improvements thereof is justified. This paper studies the variation of the diagonal matrix D entries that appear in the linear systems to be solved to try to reuse or recycle some linearly independent columns of the splitting preconditioner base previously computed in a given IPM iteration to build another basis in the next one. It is justified by the fact that a subset of linearly independent columns remains linearly independent, and from that available subset, one may complete the number of columns necessary to form the new base. The numerical results show that the column recycling proposal improves the speed and robustness of the original approach for a test set, especially for large-scale problems.
Keywords: Interior point methods; Preconditioner; Condition number; Ill-conditioned systems (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10589-023-00492-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:86:y:2023:i:1:d:10.1007_s10589-023-00492-1
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-023-00492-1
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().