On sparse matrix orderings in interior point methods
From MaRDI portal
Publication:402236
DOI10.1007/S11081-013-9233-7zbMATH Open1294.65051OpenAlexW2015874996MaRDI QIDQ402236FDOQ402236
Authors: Csaba Mészáros 
Publication date: 27 August 2014
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-013-9233-7
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
Numerical optimization and variational techniques (65K10) Computational methods for sparse matrices (65F50) Linear programming (90C05)
Cites Work
- Title not available (Why is that?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- The Evolution of the Minimum Degree Ordering Algorithm
- An Efficient Heuristic Procedure for Partitioning Graphs
- Nested Dissection of a Regular Finite Element Mesh
- Computing the Minimum Fill-In is NP-Complete
- Advanced preprocessing techniques for linear and quadratic programming
- The Use of Linear Graphs in Gauss Elimination
- On the implementation of interior point methods for dual-core platforms
- Title not available (Why is that?)
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Title not available (Why is that?)
- The BPMPD interior point solver for convex quadratic problems
- Improving the Run Time and Quality of Nested Dissection Ordering
- Computing extremal and approximate distances in graphs having unit cost edges
- The augmented system variant of IPMs in two-stage stochastic linear programming computation
- Using domain decomposition to find graph bisectors
- Detecting ``dense columns in interior point methods for linear programs
- Title not available (Why is that?)
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- Robust Ordering of Sparse Matrices using Multisection
Cited In (8)
- On the ordering of sparse linear systems
- Title not available (Why is that?)
- Ordering algorithms for irreducible sparse linear systems
- A note on matrix reordering for linear system solutions by iterative methods in interior point methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
- Title not available (Why is that?)
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)
