Sparse nonnegative solution of underdetermined linear equations by linear programming
From MaRDI portal
Recommendations
- On sparse solutions of underdetermined linear systems
- The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations
- Solution of Sparse Underdetermined Systems of Linear Equations
- Sparse solutions of underdetermined linear systems
- Sparse Solutions of Underdetermined Linear Systems and Their Applications
- Exact and approximate sparse solutions of underdetermined linear equations
- Sparse solutions of linear complementarity problems
- scientific article; zbMATH DE number 3874501
- Algorithms on the sparse solution of under-determined linear systems
- A Lagrange-Newton algorithm for sparse nonlinear programming
Cites work
Cited in
(98)- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Gaussian polytopes: a cumulant-based approach
- PROMP: a sparse recovery approach to lattice-valued signals
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- Sparse support recovery using correlation information in the presence of additive noise
- The convex geometry of linear inverse problems
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Overcoming the limitations of phase transition by higher order analysis of regularization techniques
- Analysis of the self projected matching pursuit algorithm
- Lagrangian duality and saddle points for sparse linear programming
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
- Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks
- LASSO risk and phase transition under dependence
- On non-negative solutions to large systems of random linear equations
- Sparse signal recovery via generalized Gaussian function
- Real-valued group testing for quantitative molecular assays
- Sparse recovery with integrality constraints
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Which bridge estimator is the best for variable selection?
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
- A new sparse recovery method for the inverse acoustic scattering problem
- Critical behavior and universality classes for an algorithmic phase transition in sparse reconstruction
- Universality in polytope phase transitions and message passing algorithms
- Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
- One condition for solution uniqueness and robustness of both _1-synthesis and _1-analysis minimizations
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Average case recovery analysis of tomographic compressive sensing
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Empirical average-case relation between undersampling and sparsity in X-ray CT
- Terracini convexity
- Sparse PCA: convex relaxations, algorithms and applications
- Theory and applications of compressed sensing
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Performance comparisons of greedy algorithms in compressed sensing.
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Identifying small mean-reverting portfolios
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- A note on the minimization of a Tikhonov functional with \(\ell^1\)-penalty
- Statistical mechanics of complex neural systems and high dimensional data
- Blind sensor calibration using approximate message passing
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Recovering structured signals in noise: least-squares meets compressed sensing
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Clustering and feature selection using sparse principal component analysis
- Theory of compressive sensing via _1-minimization: a non-RIP analysis and extensions
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- High-dimensional covariance matrix estimation with missing observations
- Exact reconstruction using Beurling minimal extrapolation
- UPS delivers optimal phase diagram in high-dimensional variable selection
- Distributed continuous-time algorithms for nonsmooth extended monotropic optimization problems
- Iterative positive thresholding algorithm for non-negative sparse optimization
- Volume-optimal cycle: tightest representative cycle of a generator in persistent homology
- Point-process models of social network interactions: Parameter estimation and missing data recovery
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Super-resolution of point sources via convex programming
- The restricted isometry property for random block diagonal matrices
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Search for sparse active inputs: a review
- Lifting for simplicity: concise descriptions of convex sets
- On the universality of noiseless linear estimation with respect to the measurement matrix
- Deconstructing odorant identity via primacy in dual networks
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Linear positive systems may have a reachable subset from the origin that is either polyhedral or nonpolyhedral
- Simultaneous sensing error recovery and tomographic inversion using an optimization-based approach
- On representer theorems and convex regularization
- Short-term memory capacity in networks via the restricted isometry property
- Neighborliness of randomly projected simplices in high dimensions
- Towards a Mathematical Theory of Super‐resolution
- Finding complex balanced and detailed balanced realizations of chemical reaction networks
- A semidefinite programming study of the Elfving theorem
- A survey on compressive sensing: classical results and recent advancements
- Random cones in high dimensions. I: Donoho-Tanner and Cover-Efron cones.
- Faster randomized block sparse Kaczmarz by averaging
- Estimation of predictive performance in high-dimensional data settings using learning curves
- Phase transitions for greedy sparse approximation algorithms
- Testing the nullspace property using semidefinite programming
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
- Null space conditions and thresholds for rank minimization
- Multi-expansion modal reduction: a pragmatic semi-a priori model order reduction approach for nonlinear structural dynamics
- Cardinality minimization, constraints, and regularization: a survey
- Superresolution with the zero-phase imaging condition
- Fast computation of minimal elementary decompositions of metabolic flux vectors
- Robust sparse recovery with sparse Bernoulli matrices via expanders
- Phase transition and higher order analysis of L_q regularization under dependence
- Non-negative sparse recovery at minimal sampling rate
- On SCD semismooth^* Newton methods for the efficient minimization of Tikhonov functionals with non-smooth and non-convex penalties
- Adaptive use of co-data through empirical Bayes for Bayesian additive regression trees
- On support sizes of restricted isometry constants
- Non-negative sparse signal recovery with a feasible based sequential quadratic programming
- Three novel edge detection methods for incomplete and noisy spectral data
- GPU accelerated greedy algorithms for compressed sensing
- Exact recovery of Dirac ensembles from the projection onto spaces of spherical harmonics
- A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
- Computing sparse and dense realizations of reaction kinetic systems
- Random sampling of sparse trigonometric polynomials
This page was built for publication: Sparse nonnegative solution of underdetermined linear equations by linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385846)
