Sparse nonnegative solution of underdetermined linear equations by linear programming
From MaRDI portal
Publication:5385846
DOI10.1073/pnas.0502269102zbMath1135.90368OpenAlexW2163916252WikidataQ33892298 ScholiaQ33892298MaRDI QIDQ5385846
Publication date: 7 May 2008
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.0502269102
combinatorial optimizationcyclic polytopesneighborly polytopespositivity constraints in ill-posed problemsconvex hull of Gaussian samples
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)
Related Items
Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization, Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing, Lifting for Simplicity: Concise Descriptions of Convex Sets, Identifying small mean-reverting portfolios, One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations, Gaussian polytopes: a cumulant-based approach, On non-negative solutions to large systems of random linear equations, Counting the faces of randomly-projected hypercubes and orthants, with applications, Computing sparse and dense realizations of reaction kinetic systems, On the universality of noiseless linear estimation with respect to the measurement matrix, A survey on compressive sensing: classical results and recent advancements, Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing, The non-convex sparse problem with nonnegative constraint for signal reconstruction, Distributed Continuous-Time Algorithms for Nonsmooth Extended Monotropic Optimization Problems, Sparse signal recovery via generalized Gaussian function, Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, Iterative positive thresholding algorithm for non-negative sparse optimization, Random sampling of sparse trigonometric polynomials, Volume-Optimal Cycle: Tightest Representative Cycle of a Generator in Persistent Homology, Real-valued group testing for quantitative molecular assays, PROMP: a sparse recovery approach to lattice-valued signals, Clustering and feature selection using sparse principal component analysis, Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions, The convex geometry of linear inverse problems, 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, Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays, Performance comparisons of greedy algorithms in compressed sensing, Realizability and inscribability for simplicial polytopes via nonlinear optimization, High-dimensional covariance matrix estimation with missing observations, Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization, Point-process models of social network interactions: Parameter estimation and missing data recovery, Sparse recovery with integrality constraints, Faster randomized block sparse Kaczmarz by averaging, Unnamed Item, Block-sparse recovery of semidefinite systems and generalized null space conditions, Terracini convexity, Phase transitions for greedy sparse approximation algorithms, Estimation of predictive performance in high-dimensional data settings using learning curves, Sparse support recovery using correlation information in the presence of additive noise, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, 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, Super-resolution of point sources via convex programming, Average case recovery analysis of tomographic compressive sensing, Exact reconstruction using Beurling minimal extrapolation, Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets, UPS delivers optimal phase diagram in high-dimensional variable selection, Which bridge estimator is the best for variable selection?, Short-Term Memory Capacity in Networks via the Restricted Isometry Property, The restricted isometry property for random block diagonal matrices, Neighborliness of randomly projected simplices in high dimensions, A note on the minimization of a Tikhonov functional with ℓ1-penalty, Fast computation of minimal elementary decompositions of metabolic flux vectors, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, Statistical mechanics of complex neural systems and high dimensional data, Blind sensor calibration using approximate message passing, Deconstructing Odorant Identity via Primacy in Dual Networks, Overcoming the limitations of phase transition by higher order analysis of regularization techniques, Search for Sparse Active Inputs: A Review, The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement, Towards a Mathematical Theory of Super‐resolution, Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices, Analysis of the self projected matching pursuit algorithm, Finding complex balanced and detailed balanced realizations of chemical reaction networks, A semidefinite programming study of the Elfving theorem, Lagrangian duality and saddle points for sparse linear programming, Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks, On support sizes of restricted isometry constants, Sparse PCA: Convex Relaxations, Algorithms and Applications, Three novel edge detection methods for incomplete and noisy spectral data, Counting faces of randomly projected polytopes when the projection radically lowers dimension, GPU accelerated greedy algorithms for compressed sensing, Exact recovery of Dirac ensembles from the projection onto spaces of spherical harmonics, A new sparse recovery method for the inverse acoustic scattering problem, 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, Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit, On Representer Theorems and Convex Regularization, Critical behavior and universality classes for an algorithmic phase transition in sparse reconstruction, A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation, Universality in polytope phase transitions and message passing algorithms, Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks, Theory and applications of compressed sensing, LASSO risk and phase transition under dependence, Empirical average-case relation between undersampling and sparsity in X-ray CT
Cites Work
