OCP: a greedy projection method for row-sparse representations of minimum-norm solutions
From MaRDI portal
Cites work
- A federated Kaczmarz algorithm
- A numerically stable dual method for solving strictly convex quadratic programs
- A randomized Kaczmarz algorithm with exponential convergence
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
- Adaptive greedy approximations
- Core vector machines: fast SVM training on very large data sets
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Decoding by Linear Programming
- Faster randomized block Kaczmarz algorithms
- Geometric approach to error-correcting codes and reconstruction of signals
- Greed is Good: Algorithmic Results for Sparse Approximation
- Introduction to the non-asymptotic analysis of random matrices
- Iterative Methods for Sparse Linear Systems
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- LIBSVM
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Near-Optimal Coresets for Least-Squares Regression
- On fast greedy block Kaczmarz methods for solving large consistent linear systems
- On greedy randomized average block Kaczmarz method for solving large linear systems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On the Implementation of a Primal-Dual Interior Point Method
- Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Kaczmarz methods with beyond-Krylov convergence
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Approximate Solutions to Linear Systems
- Sparse sensor placement optimization for classification
- Support Vector Machines with the Ramp Loss and the Hard Margin Loss
- The N‐Step Iteration Procedures
- The Relaxation Method for Linear Inequalities
- The University of Florida sparse matrix collection
- Working set selection using second order information for training support vector machines
This page was built for publication: OCP: a greedy projection method for row-sparse representations of minimum-norm solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7452736)