Sparsity preserving preconditioners for linear systems in interior-point methods
From MaRDI portal
Publication:493682
DOI10.1007/s10589-015-9735-7zbMath1330.90134OpenAlexW1974348316MaRDI QIDQ493682
Milan D. Dražić, Rade P. Lazović, Vera V. Kovacevic-Vujcic
Publication date: 4 September 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9735-7
Linear programming (90C05) Interior-point methods (90C51) Preconditioners for iterative methods (65F08)
Related Items (5)
Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ Improving the preconditioning of linear systems from interior point methods ⋮ Recycling basic columns of the splitting preconditioner in interior point methods ⋮ Using groups in the splitting preconditioner computation for interior point methods ⋮ A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- Asymptotic behaviour of Karmarkar's method for linear programming
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Stabilization of Mehrotra's primal-dual algorithm and its implementation
- Stabilization of interior-point methods for linear programming
- Preconditioning indefinite systems in interior point methods for optimization
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- 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 Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- Block preconditioners for symmetric indefinite linear systems
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods
- Maximum‐weight‐basis preconditioners
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- Preconditioners for Indefinite Systems Arising in Optimization
- On the Implementation of a Primal-Dual Interior Point Method
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Constraint Preconditioning for Indefinite Linear Systems
- Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods
- Preconditioning methods for linear systems arising in constrained optimization problems
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
This page was built for publication: Sparsity preserving preconditioners for linear systems in interior-point methods
