Recycling basic columns of the splitting preconditioner in interior point methods
From MaRDI portal
Publication:6166647
DOI10.1007/s10589-023-00492-1OpenAlexW4377988525MaRDI QIDQ6166647
Cecilia Orellana Castro, Manolo Rodriguez Heredia, Aurelio Ribeiro Leite Oliveira
Publication date: 3 August 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-023-00492-1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix-free interior point method
- Interior point methods 25 years later
- Sparsity preserving preconditioners for linear systems in interior-point methods
- The Cholesky factorization in interior point methods
- Further development of multiple centrality correctors for interior point methods
- Improving the preconditioning of linear systems from interior point methods
- Using groups in the splitting preconditioner computation for interior point methods
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Symmetric indefinite systems for interior point methods
- Multiple centrality corrections in a primal-dual method for linear programming
- A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
- Implementation of an interior point method with basis preconditioning
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method
- Exploiting structure in parallel implementation of interior point methods for optimization
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Inexact constraint preconditioners for linear systems arising in interior point methods
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- On Numerical Issues of Interior Point Methods
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- An Efficient Solver for Multi--Right-Hand-Side Linear Systems Based on the CCCG($\eta$) Method with Applications to Implicit Time-Dependent Partial Differential Equations
- Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods
- Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach
- Constraint-Style Preconditioners for Regularized Saddle Point Problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: Recycling basic columns of the splitting preconditioner in interior point methods
