New preconditioners applied to linear programming and the compressive sensing problems
From MaRDI portal
Recommendations
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- Publication:4945783
- A new preconditioning technique for solving large sparse linear systems
- On the preconditioned projective iterative methods for the linear complementarity problems
- Sparsity preserving preconditioners for linear systems in interior-point methods
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Optimal preconditioners of a given sparsity pattern
- A general preconditioner for linear complementarity problem with an \(M\)-matrix
- Preconditioned SSOR methods for the linear complementarity problem with \(M\)-matrix
Cites work
- scientific article; zbMATH DE number 47594 (Why is no real title available?)
- A matrix-free smoothing algorithm for large-scale support vector machines
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
- An efficient augmented Lagrangian method with applications to total variation minimization
- Decoding by Linear Programming
- On a geometrization of the Chung-Lu model for complex networks
- Spectral compressive sensing
- Templates for convex cone problems with applications to sparse signal recovery
Cited in
(2)
This page was built for publication: New preconditioners applied to linear programming and the compressive sensing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226494)
