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-0zbMATH Open1375.90216OpenAlexW2559587410MaRDI QIDQ2012233FDOQ2012233
Porfirio Suñagua, Aurelio R. L. 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
Recommendations
- A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods
- Improving the preconditioning of linear systems from interior point methods
- Computing the splitting preconditioner for interior point method using an incomplete factorization approach
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Implementation of an interior point method with basis preconditioning
- A New Approach to the Splitting Factor Preconditioner Applied to Linear Programming Problems
- Sparsity preserving preconditioners for linear systems in interior-point methods
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- A new splitting preconditioner for the iterative solution of complex symmetric indefinite linear systems
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
Cites Work
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Algorithm 837
- PCx: an interior-point code for linear programming
- Algorithm 832
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Interior point methods 25 years later
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- Computing the Minimum Fill-In is NP-Complete
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Title not available (Why is that?)
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- A new class of preconditioners for large-scale linear systems 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
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
- Sparsity preserving preconditioners for linear systems in interior-point methods
- Preconditioning indefinite systems in interior point methods for optimization
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Towards Stable Mixed Pivoting Strategies for the Sequential and Parallel Solution of Sparse Symmetric Indefinite Systems
Cited In (4)
- Using groups in the splitting preconditioner computation for interior point methods
- Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming
- Recycling basic columns of the splitting preconditioner in interior point methods
- A new proposal to improve the early iterations in the interior point method
Uses Software
This page was built for publication: A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012233)
