Sparsity preserving preconditioners for linear systems in interior-point methods
From MaRDI portal
Publication:493682
DOI10.1007/S10589-015-9735-7zbMATH Open1330.90134OpenAlexW1974348316MaRDI QIDQ493682FDOQ493682
Authors: Milan D. Dražić, Rade P. Lazović, Vera Kovačević-Vujčić 
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
Recommendations
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- General-purpose preconditioning for regularized interior point methods
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Preconditioning indefinite systems in interior point methods for optimization
Linear programming (90C05) Interior-point methods (90C51) Preconditioners for iterative methods (65F08)
Cites Work
- On the Implementation of a Primal-Dual Interior Point Method
- Constraint Preconditioning for Indefinite Linear Systems
- Preconditioners for Indefinite Systems Arising in Optimization
- Block preconditioners for symmetric indefinite linear systems
- A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- 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
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- Preconditioning methods for linear systems arising in constrained optimization problems
- Stabilization of Mehrotra's primal-dual algorithm and its implementation
- Stabilization of interior-point methods for linear programming
- 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
- Maximum‐weight‐basis preconditioners
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods
- Title not available (Why is that?)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- Asymptotic behaviour of Karmarkar's method for linear programming
Cited In (20)
- Using groups in the splitting preconditioner computation for interior point methods
- On sparse matrix orderings in interior point methods
- Sparse Preconditioned Iterative Methods for Dense Linear Systems
- Computing the splitting preconditioner for interior point method using an incomplete factorization approach
- A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
- Rational approximation preconditioners for sparse linear systems.
- New preconditioners applied to linear programming and the compressive sensing problems
- Recycling basic columns of the splitting preconditioner in interior point methods
- Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques
- Optimal preconditioners of a given sparsity pattern
- Matrix-free interior point method
- Improving the preconditioning of linear systems from interior point methods
- Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods
- Some preconditioners for systems of linear inequalities
- A study of preconditioners for network interior point methods
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- General-purpose preconditioning for regularized interior point methods
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
Uses Software
This page was built for publication: Sparsity preserving preconditioners for linear systems in interior-point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493682)
