Dual multilevel optimization
From MaRDI portal
Publication:2465655
DOI10.1007/s10107-006-0022-3zbMath1145.90038MaRDI QIDQ2465655
William W. Hager, Timothy A. Davis
Publication date: 7 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0022-3
Parallel algorithms; Multilevel optimization; Dual active set algorithm; Dual optimization; Dual separability
Related Items
How good are extrapolated bi-projection methods for linear feasibility problems?, A sparse proximal implementation of the LP dual active set algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Partitioning mathematical programs for parallel solution
- Parallel interior-point solver for structured linear programs
- Presolving in linear programming
- Application of the dual active set algorithm to quadratic network optimization
- A sparse proximal implementation of the LP dual active set algorithm
- Hyper-sparsity in the revised simplex method and how to exploit it
- Multiple-Rank Modifications of a Sparse Cholesky Factorization
- Nested-Dissection Orderings for Sparse LU with Partial Pivoting
- Algorithm 849
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Improving the Run Time and Quality of Nested Dissection Ordering
- Modifying a Sparse Cholesky Factorization
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Commentary—Progress in Linear Programming
- A Cartesian Parallel Nested Dissection Algorithm
- A set of level 3 basic linear algebra subprograms
- A generalized envelope method for sparse factorization by rows
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Row Modifications of a Sparse Cholesky Factorization
- A column approximate minimum degree ordering algorithm
- The dual active set algorithm and its application to linear programming
