Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
From MaRDI portal
Publication:3604921
DOI10.1109/TIT.2008.929958zbMath1247.94009OpenAlexW2098012923MaRDI QIDQ3604921
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.929958
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, Global sensitivity analysis based on high-dimensional sparse surrogate construction, WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions, Low-Rank and Sparse Dictionary Learning, Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique, Global optimization for sparse solution of least squares problems, Two Algorithms for Compressed Sensing of Sparse Tensors, Computational Spectral and Ultrafast Imaging via Convex Optimization, Sparse microwave imaging: principles and applications, Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor, Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming, Iterative nearest neighbors, A fast splitting method tailored for Dantzig selector, A smoothing neural network for minimization \(l_1\)-\(l_p\) in sparse signal reconstruction with measurement noises, Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications, Robust visual tracking with structured sparse representation appearance model, Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares, A single gallery-based face recognition using extended joint sparse representation, Sparse conjugate directions pursuit with application to fixed-size kernel models, A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming, A simple homotopy proximal mapping algorithm for compressive sensing, Contraction-based model predictive control for stochastic nonlinear discrete-time systems with time-varying delays via multi-dimensional Taylor network, Flexible semi-supervised embedding based on adaptive loss regression: application to image categorization, Sparse Bayesian learning approach for discrete signal reconstruction, Phase transitions for greedy sparse approximation algorithms, Reconstruction of sparse recurrent connectivity and inputs from the nonlinear dynamics of neuronal networks, Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction, Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization, Compressive Sensing, Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization, Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework, A computational study of the role of spatial receptive field structure in processing natural and non-natural scenes, Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification, An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate, Generalized Peaceman-Rachford splitting method with substitution for convex programming, A fast homotopy algorithm for gridless sparse recovery, Sparse and nonnegative sparse D-MORPH regression, The homotopy method revisited: Computing solution paths of $\ell _1$-regularized problems, A probabilistic learning algorithm for robust modeling using neural networks with random weights, A Tight Bound of Hard Thresholding, Local behavior of sparse analysis regularization: applications to risk estimation, A Projection Proximal-Point Algorithm for ℓ1Minimization, Convergence of fixed-point continuation algorithms for matrix rank minimization, A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization, Templates for convex cone problems with applications to sparse signal recovery, Sparsity in time-frequency representations, Fixed point and Bregman iterative methods for matrix rank minimization, Compressive wave computation, Ways to sparse representation: An overview, On support sizes of restricted isometry constants, Unnamed Item, Unnamed Item, Sparse representation-based patient-specific diagnosis and treatment for esophageal squamous cell carcinoma, Low Complexity Regularization of Linear Inverse Problems, Sparsity preserving projections with applications to face recognition, A parameterized proximal point algorithm for separable convex optimization, Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization, GPU accelerated greedy algorithms for compressed sensing, Tensor Least Angle Regression for Sparse Representations of Multidimensional Signals, Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization, Solution paths of variational regularization methods for inverse problems, Iteratively reweighted least squares minimization for sparse recovery, An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming, Sparse regression with output correlation for cardiac ejection fraction estimation, Weighted thresholding homotopy method for sparsity constrained optimization, A time continuation based fast approximate algorithm for compressed sensing related optimization, Data-driven prediction of multistable systems from sparse measurements, Data-Driven Reconstruction and Encoding of Sparse Stimuli across Convergent Sensory Layers from Downstream Neuronal Network Dynamics, Solving Basis Pursuit
