On sparse matrix orderings in interior point methods
From MaRDI portal
Recommendations
- Sparse approximations with interior point methods
- Sparsity in convex quadratic programming with interior point methods
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- Sparsity preserving preconditioners for linear systems in interior-point methods
- scientific article; zbMATH DE number 597812
- On the ordering of sparse linear systems
- On the ordering of sparse linear systems
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- Ordering algorithms for irreducible sparse linear systems
- Orderings for Factorized Sparse Approximate Inverse Preconditioners
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 1187129 (Why is no real title available?)
- scientific article; zbMATH DE number 1047679 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Advanced preprocessing techniques for linear and quadratic programming
- An Efficient Heuristic Procedure for Partitioning Graphs
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- Computing extremal and approximate distances in graphs having unit cost edges
- Computing the Minimum Fill-In is NP-Complete
- Detecting ``dense columns in interior point methods for linear programs
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Improving the Run Time and Quality of Nested Dissection Ordering
- Nested Dissection of a Regular Finite Element Mesh
- On the implementation of interior point methods for dual-core platforms
- Robust Ordering of Sparse Matrices using Multisection
- The BPMPD interior point solver for convex quadratic problems
- The Evolution of the Minimum Degree Ordering Algorithm
- The Use of Linear Graphs in Gauss Elimination
- The augmented system variant of IPMs in two-stage stochastic linear programming computation
- Using domain decomposition to find graph bisectors
Cited in
(8)- scientific article; zbMATH DE number 1183042 (Why is no real title available?)
- A note on matrix reordering for linear system solutions by iterative methods in interior point methods
- scientific article; zbMATH DE number 724214 (Why is no real title available?)
- Ordering algorithms for irreducible sparse linear systems
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
- scientific article; zbMATH DE number 1187129 (Why is no real title available?)
- On the ordering of sparse linear systems
- scientific article; zbMATH DE number 4115836 (Why is no real title available?)
Describes a project that uses
Uses Software
This page was built for publication: On sparse matrix orderings in interior point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402236)
