Pages that link to "Item:Q803727"
From MaRDI portal
The following pages link to Splitting dense columns in sparse linear systems (Q803727):
Displaying 15 items.
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Solving symmetric indefinite systems in an interior-point method for linear programming (Q1321659) (← links)
- Matrix enlarging methods and their application (Q1371659) (← links)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- Block row projection method based on M-matrix splitting (Q1636825) (← links)
- Fast Fourier optimization (Q1762460) (← links)
- Detecting ``dense'' columns in interior point methods for linear programs (Q2643620) (← links)
- Matrix stretching for sparse least squares problems (Q2760330) (← links)
- Splitting dense columns of constraint matrix in interior point methods for large scale linear programming<sup>1</sup><sup>1</sup>The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Pl (Q4327921) (← links)
- A modified Schur-complement method for handling dense columns in interior-point methods for linear programming (Q4371101) (← links)
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods (Q4594173) (← links)
- SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER (Q4820060) (← links)
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems (Q5066598) (← links)
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems (Q5230611) (← links)
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement (Q5889340) (← links)
