A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
From MaRDI portal
Publication:2012233
DOI10.1007/s10589-016-9887-0zbMath1375.90216OpenAlexW2559587410MaRDI QIDQ2012233
Porfirio Suñagua, Aurelio Ribeiro Leite Oliveira
Publication date: 28 July 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9887-0
Related Items (4)
A new proposal to improve the early iterations in the interior point method ⋮ Recycling basic columns of the splitting preconditioner in interior point methods ⋮ Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming ⋮ Using groups in the splitting preconditioner computation for interior point methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior point methods 25 years later
- Sparsity preserving preconditioners for linear systems in interior-point methods
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Preconditioning indefinite systems in interior point methods for optimization
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- The Elimination form of the Inverse and its Application to Linear Programming
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- Towards Stable Mixed Pivoting Strategies for the Sequential and Parallel Solution of Sparse Symmetric Indefinite Systems
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- Computing the Minimum Fill-In is NP-Complete
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- PCx: an interior-point code for linear programming
- On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Algorithm 832
- Algorithm 837
- Benchmarking optimization software with performance profiles.
This page was built for publication: A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
