Implementing Recycling Methods for Linear Systems in Python with an Application to Multiple Objective Optimization
Not on the map. Why?
Abstract (arXiv)
Sequences of linear systems arise in the predictor-corrector method when computing the Pareto front for multi-objective optimization. Rather than discarding information generated when solving one system, it may be advantageous to recycle information for subsequent systems. To accomplish this, we seek to reduce the overall cost of computation when solving linear systems using common recycling methods. In this work, we assessed the performance of recycling minimum residual (RMINRES) method along with a map between coefficient matrices. For these methods to be fully integrated into the software used in Enouen et al. (2022), there must be working version of each in both Python and PyTorch. Herein, we discuss the challenges we encountered and solutions undertaken (and some ongoing) when computing efficient Python implementations of these recycling strategies. The goal of this project was to implement RMINRES in Python and PyTorch and add it to the established Pareto front code to reduce computational cost. Additionally, we wanted to implement the sparse approximate maps code in Python and PyTorch, so that it can be parallelized in future work.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 3 of its 11 references that are in the map. First posted on arXiv 25 Feb 2024.
Builds on
3 of 11 references.
References · 3
- 2020Efficient Continuous Pareto Exploration in Multi-Task Learningcited by 57
- 2019The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learningcited by 45
- 2022Efficient first-order predictor-corrector multiple objective optimization for fair misinformation detectioncited by 1
Built on by
Not cited yet.