Sparse Approximate Solutions to Linear Systems
From MaRDI portal
Recommendations
- Efficient approximate solution of sparse linear systems
- scientific article; zbMATH DE number 1153374
- Sparse solutions of underdetermined linear systems
- Exact and approximate sparse solutions of underdetermined linear equations
- Sparse Solutions of Underdetermined Linear Systems and Their Applications
- On sparse solutions of underdetermined linear systems
- scientific article; zbMATH DE number 2065130
- scientific article; zbMATH DE number 4041162
- Sparse linear problems and the least squares method
- Solution of Sparse Underdetermined Systems of Linear Equations
Cited in
(only showing first 100 items - show all)- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Sparse solutions to underdetermined Kronecker product systems
- Exploiting the sparsity in the solution of linear ordinary differential equations
- Solving sparse linear systems by an ABS-method that corresponds to LU- decomposition
- Parsimonious least norm approximation
- Sparse approximate multiquadric interpolation
- MOEA/D with chain-based random local search for sparse optimization
- Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios
- Global optimization for low-dimensional switching linear regression and bounded-error estimation
- \(l_1\)-\(l_2\) regularization of split feasibility problems
- Quasi-interpolation and outliers removal
- Prior model identification during subsurface flow data integration with adaptive sparse representation techniques
- The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
- Best subset binary prediction
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Optimality condition and complexity of order-value optimization problems and low order-value optimization problems
- An improved algorithm for the \(L_2-L_p\) minimization problem
- A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
- Weak fault detection of tapered rolling bearing based on penalty regularization approach
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach
- Robust missing traffic flow imputation considering nonnegativity and road capacity
- Median filter based compressed sensing model with application to MR image reconstruction
- An adaptive gradient projection algorithm for piecewise convex optimization and its application in compressed spectrum sensing
- Analysis sparse representation for nonnegative signals based on determinant measure by DC programming
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- Efficient projected gradient methods for cardinality constrained optimization
- Maximal solutions of sparse analysis regularization
- An overview on the applications of matrix theory in wireless communications and signal processing
- Learning semidefinite regularizers
- Measuring and moderating opinion polarization in social networks
- Fast L1-L2 minimization via a proximal operator
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- A probabilistic learning algorithm for robust modeling using neural networks with random weights
- DC formulations and algorithms for sparse optimization problems
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Dictionary evaluation and optimization for sparse coding based speech processing
- Matrix completion under interval uncertainty
- Recovery of seismic wavefields by an \(l_{q}\)-norm constrained regularization method
- Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach
- A novel detection scheme with multiple observations for sparse signal based on likelihood ratio test with sparse estimation
- Structured overcomplete sparsifying transform learning with convergence guarantees and applications
- Computing sparse approximations deterministically
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Strengthening hash families and compressive sensing
- Sparsity driven people localization with a heterogeneous network of cameras
- Accelerated linearized Bregman method
- Sparse signal recovery via ECME thresholding pursuits
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
- A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
- Restricted strong convexity implies weak submodularity
- Optimality conditions for locally Lipschitz optimization with l₀-regularization
- Sparse approximate reconstruction decomposed by two optimization problems
- Analysis of the self projected matching pursuit algorithm
- Salt and pepper noise removal based on an approximation of \(l_0\) norm
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Surrogate optimization for \(p\)-norms
- An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem
- Complexity and applications of the homotopy principle for uniformly constrained sparse minimization
- Optimization problems for machine learning: a survey
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- The horseshoe-like regularization for feature subset selection
- Subspace quadratic regularization method for group sparse multinomial logistic regression
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images
- Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling
- Sparse approximate solutions to max-plus equations
- On the computational complexity of the secure state-reconstruction problem
- Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration
- Sparse classification: a scalable discrete optimization perspective
- IDPCNN: iterative denoising and projecting CNN for MRI reconstruction
- Robust subset selection
- New bounds for subset selection from conic relaxations
- Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
- Nonparametric regression with modified ReLU networks
- Variable selection in convex quantile regression: \(\mathcal{L}_1\)-norm or \(\mathcal{L}_0\)-norm regularization?
- Commonsense explanations of sparsity, Zipf law, and Nash's bargaining solution
- A Lagrange-Newton algorithm for sparse nonlinear programming
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- Convex optimization under combinatorial sparsity constraints
- A linear system output transformation for sparse approximation
- Proof methods for robust low-rank matrix recovery
- Sparse recovery of sound fields using measurements from moving microphones
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Ideal formulations for constrained convex optimization problems with indicator variables
- Sparse representation of vectors in lattices and semigroups
- Deterministic convergence analysis via smoothing group Lasso regularization and adaptive momentum for Sigma-Pi-Sigma neural network
- Efficient projection algorithms onto the weighted \(\ell_1\) ball
- Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization
- GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
- A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks
- Clustering, multicollinearity, and singular vectors
- Sparse signal recovery via generalized Gaussian function
- The use of grossone in elastic net regularization and sparse support vector machines
- The backbone method for ultra-high dimensional sparse machine learning
This page was built for publication: Sparse Approximate Solutions to Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834376)
