On sparse matrix orderings in interior point methods
type: Item
instance of: scholarly article
title: On sparse matrix orderings in interior point methods
zbMATH Open document ID: 1294.65051
published in: Optimization and Engineering
publication date: 2014-08-27T00:00:00Z
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6335015
zbMATH Keywords: sparse matrix ordering
zbMATH Keywords: nested dissection
zbMATH Keywords: interior point methods
author: Csaba Mészáros
describes a project that uses: symrcm
describes a project that uses: BPMPD
describes a project that uses: METIS
describes a project that uses: Chaco
describes a project that uses: Decision tree for optimization software
MaRDI profile type: Publication
full work available at URL: s11081-013-9233-7
OpenAlex ID: W2015874996
cites work: Q4347846
cites work: Using domain decomposition to find graph bisectors
cites work: Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
cites work: Robust Ordering of Sparse Matrices using Multisection
cites work: Computing extremal and approximate distances in graphs having unit cost edges
cites work: Q3740904
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: Nested Dissection of a Regular Finite Element Mesh
cites work: Q3664299
cites work: The Evolution of the Minimum Degree Ordering Algorithm
cites work: Improving the Run Time and Quality of Nested Dissection Ordering
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
cites work: The augmented system variant of IPMs in two-stage stochastic linear programming computation
cites work: Q3840333
cites work: The BPMPD interior point solver for convex quadratic problems
cites work: Detecting ``dense'' columns in interior point methods for linear programs
cites work: On the implementation of interior point methods for dual-core platforms
cites work: Advanced preprocessing techniques for linear and quadratic programming
cites work: Computing the Minimum Fill-In is NP-Complete
cites work: The Use of Linear Graphs in Gauss Elimination
DOI: 10.1007/S11081-013-9233-7
Recommended article: Sparse Approximations with Interior Point Methods
Recommended article: Sparsity in convex quadratic programming with interior point methods
Recommended article: Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
Recommended article: Sparsity preserving preconditioners for linear systems in interior-point methods
Recommended article: Q4298850
Recommended article: On the ordering of sparse linear systems
Recommended article: Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
Recommended article: Ordering algorithms for irreducible sparse linear systems
Recommended article: Orderings for Factorized Sparse Approximate Inverse Preconditioners
description: scientific article; zbMATH DE number 6335015