Just relax: convex programming methods for identifying sparse signals in noise
From MaRDI portal
Publication:3547718
DOI10.1109/TIT.2005.864420zbMath1288.94025WikidataQ59750791 ScholiaQ59750791MaRDI QIDQ3547718
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
90C25: Convex programming
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
94A13: Detection theory in information and communication theory
Related Items
Nearly unbiased variable selection under minimax concave penalty, A unified approach to model selection and sparse recovery using regularized least squares, Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm, Best subset selection via a modern optimization lens, Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity, Data-driven design of two degree-of-freedom nonlinear controllers: the \(\operatorname{D}^2\)-IBC approach, Matrix sparsification and the sparse null space problem, Regularity properties of non-negative sparsity sets, Gradient methods for minimizing composite functions, Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization, ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals, Model-based multiple rigid object detection and registration in unstructured range data, The residual method for regularizing ill-posed problems, Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization, Two are better than one: fundamental parameters of frame coherence, A modified greedy analysis pursuit algorithm for the cosparse analysis model, Sparse signal recovery using a new class of random matrices, Tightness of the maximum likelihood semidefinite relaxation for angular synchronization, Convergence of fixed-point continuation algorithms for matrix rank minimization, A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization, Fixed point and Bregman iterative methods for matrix rank minimization, A semidefinite programming study of the Elfving theorem, Adaptive algorithms for sparse system identification, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Dualization of signal recovery problems, Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method, Autoregressive process modeling via the Lasso procedure, On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization, Direct data domain STAP using sparse representation of clutter spectrum, Registration-based compensation using sparse representation in conformal-array STAP, Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty, A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization, Inferring stable genetic networks from steady-state data, Optimal identification experiment design for LPV systems using the local approach, Spectral dynamics and regularization of incompletely and irregularly measured data, Regularized learning in Banach spaces as an optimization problem: representer theorems, Iterative thresholding for sparse approximations, Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms, Enhancing sparsity by reweighted \(\ell _{1}\) minimization, Theoretical guarantees for graph sparse coding, Minimizers of sparsity regularized Huber loss function, High-dimensional variable selection, High-dimensional analysis of semidefinite relaxations for sparse principal components, Non-convex sparse regularisation, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, Optimal dual certificates for noise robustness bounds in compressive sensing, On the conditioning of random subdictionaries, Sparse approximate solution of partial differential equations, High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression, When do stepwise algorithms meet subset selection criteria?, Lasso-type recovery of sparse representations for high-dimensional data, Relaxed maximum a posteriori fault identification, Average performance of the approximation in a dictionary using an \(\ell _0\) objective, Mixed linear system estimation and identification, Signal recovery under cumulative coherence, On stepwise pattern recovery of the fused Lasso, Iterative identification for multivariable systems with time-delays based on basis pursuit de-noising and auxiliary model, Compressed sensing with structured sparsity and structured acquisition, TV+TV regularization with nonconvex sparseness-inducing penalty for image restoration, A CS recovery algorithm for model and time delay identification of MISO-FIR systems, Control of MIMO nonlinear systems: a data-driven model inversion approach, Equivalent Lipschitz surrogates for zero-norm and rank optimization problems, Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem, Beyond canonical dc-optimization: the single reverse polar problem, High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence, IDENT: identifying differential equations with numerical time evolution, Limited-complexity controller tuning: a set membership data-driven approach, A performance guarantee for orthogonal matching pursuit using mutual coherence, When is there a representer theorem? Reflexive Banach spaces, Second-order Stein: SURE for SURE and other applications in high-dimensional inference, Structured iterative hard thresholding with on- and off-grid applications, In defense of the indefensible: a very naïve approach to high-dimensional inference, New bounds for subset selection from conic relaxations, Model recovery for multi-input signal-output nonlinear systems based on the compressed sensing recovery theory, De-biasing the Lasso with degrees-of-freedom adjustment, Bias versus non-convexity in compressed sensing, A smoothing method for sparse optimization over convex sets, New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem, Homogeneous penalizers and constraints in convex image restoration, An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices, Stable restoration and separation of approximately sparse signals, Iterative reweighted noninteger norm regularizing SVM for gene expression data classification, A numerical exploration of compressed sampling recovery, Sorted concave penalized regression, Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem, Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint, Sparse reconstruction with multiple Walsh matrices, Alternating direction method of multipliers for solving dictionary learning models, Robust computation of linear models by convex relaxation, A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring, Sparse RBF surface representations, On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, Leading impulse response identification via the elastic net criterion, Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model, A simple homotopy proximal mapping algorithm for compressive sensing, Support union recovery in high-dimensional multivariate regression, Consistency of \(\ell_1\) recovery from noisy deterministic measurements, Sparsity- and continuity-promoting seismic image recovery with curvelet frames, Rodeo: Sparse, greedy nonparametric regression, Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery, Unnamed Item, Unnamed Item, Disparity and optical flow partitioning using extended Potts priors, Proximal Mapping for Symmetric Penalty and Sparsity, Unnamed Item, An adaptive inverse scale space method for compressed sensing, Understanding large text corpora via sparse machine learning, Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction, Multi-Layer Sparse Coding: The Holistic Way, The Noise Collector for sparse recovery in high dimensions, Analysis of simultaneous inpainting and geometric separation based on sparse decomposition, Asymptotic Theory of \(\boldsymbol \ell _1\) -Regularized PDE Identification from a Single Noisy Trajectory, Independently Interpretable Lasso for Generalized Linear Models, Inferring Sparse Preference Lists from Partial Information, On the Convergence of the SINDy Algorithm, Imaging with highly incomplete and corrupted data, Weak-Type Estimates for the Metaplectic Representation Restricted to the Shearing and Dilation Subgroup of $$SL(2,\mathbb {R})$$, Sparse Bayesian Imaging of Solar Flares, Sparse identification of nonlinear dynamics for model predictive control in the low-data limit, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, Solving Basis Pursuit, Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method, Foundations of Gauge and Perspective Duality, Improved Sparse Coding Under the Influence of Perceptual Attention, Towards a Mathematical Theory of Super‐resolution, Confidence Intervals for Low Dimensional Parameters in High Dimensional Linear Models, Structured sparsity through convex optimization, A general theory of concave regularization for high-dimensional sparse estimation problems, LPV system identification for control using the local approach, Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares, Nonlinear system identification in Sobolev spaces, Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery, Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization, When does OMP achieve exact recovery with continuous dictionaries?, Newton method for \(\ell_0\)-regularized optimization, Quadratic growth conditions and uniqueness of optimal solution to Lasso, SONIC: social network analysis with influencers and communities, On the informativity of direct identification experiments in dynamical networks, When Ramanujan meets time-frequency analysis in complicated time series analysis, On FISTA with a relative error rule, Randomized pick-freeze for sparse Sobol indices estimation in high dimension, Duality and Convex Programming, Resolution Analysis of Imaging with $\ell_1$ Optimization, Low Complexity Regularization of Linear Inverse Problems, Statistical Optimization in High Dimensions, Sparse set membership identification of nonlinear functions and application to fault detection, Proximal Splitting Methods in Signal Processing, On optimal solutions of the constrained ℓ 0 regularization and its penalty problem, Linearized Bregman iterations for compressed sensing, Necessary and sufficient conditions for linear convergence of ℓ1-regularization, Average Performance of the Sparsest Approximation Using a General Dictionary, Book Review: A mathematical introduction to compressive sensing, On Reconstructing Functions from Binary Measurements, A component lasso
