A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
On sparse matrix orderings in interior point methods
Abstract The major computational task of most interior point implementations is solving systems of equations with symmetric coefficient matrix by direct factorization methods, therefore, the performance of Cholesky-like factorizations is a critical issue. In the case of sparse and large problems the efficiency of the factorizations is closely related to the exploitation of the nonzero structure of the problem. A number of techniques were developed for fill-reducing sparse matrix orderings which make Cholesky factorizations more efficient by reducing the necessary floating point computations. We present a variant of the nested dissection algorithm incorporating special techniques that are beneficial for graph partitioning problems arising in the ordering step of interior point implementations. We illustrate the behavior of our algorithm and provide numerical results and comparisons with other sparse matrix ordering algorithms.
On sparse matrix orderings in interior point methods
Abstract The major computational task of most interior point implementations is solving systems of equations with symmetric coefficient matrix by direct factorization methods, therefore, the performance of Cholesky-like factorizations is a critical issue. In the case of sparse and large problems the efficiency of the factorizations is closely related to the exploitation of the nonzero structure of the problem. A number of techniques were developed for fill-reducing sparse matrix orderings which make Cholesky factorizations more efficient by reducing the necessary floating point computations. We present a variant of the nested dissection algorithm incorporating special techniques that are beneficial for graph partitioning problems arising in the ordering step of interior point implementations. We illustrate the behavior of our algorithm and provide numerical results and comparisons with other sparse matrix ordering algorithms.
On sparse matrix orderings in interior point methods
Mészáros, Csaba (author)
Optimization and Engineering ; 14 ; 519-527
2013-11-01
9 pages
Article (Journal)
Electronic Resource
English
On sparse matrix orderings in interior point methods
| Online Contents | 2013
Interior-Point Methods in l1 Optimal Sparse Representation Algorithms for Harmonic Retrieval
| Online Contents | 2004
Interior-Point Methods in l 1 Optimal Sparse Representation Algorithms for Harmonic Retrieval
| Springer Verlag | 2004
Preference diversity orderings
| DataCite | 2016
Interior point multigrid methods for topology optimization
| British Library Online Contents | 2000