Atomic decomposition by basis pursuit
From MaRDI portal
Publication:2706429
Recommendations
- Atomic Decomposition by Basis Pursuit
- Stable recovery of sparse overcomplete representations in the presence of noise
- Probing the Pareto frontier for basis pursuit solutions
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Matching pursuits with time-frequency dictionaries
Cited in
(only showing first 100 items - show all)- Estimation and Uncertainty Quantification for Piecewise Smooth Signal Recovery
- Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Independent multiresolution component analysis and matching pursuit
- Another look at Huber's estimator: a new minimax estimator in regression with stochastically bounded noise
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
- A general theory of concave regularization for high-dimensional sparse estimation problems
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Sparsest piecewise-linear regression of one-dimensional data
- Huberization image restoration model from incomplete multiplicative noisy data
- Identifying small mean-reverting portfolios
- Super-resolution by means of Beurling minimal extrapolation
- Multi-layer sparse coding: the holistic way
- scientific article; zbMATH DE number 7750674 (Why is no real title available?)
- Spectral dynamics and regularization of incompletely and irregularly measured data
- Spectral Compressed Sensing via Projected Gradient Descent
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
- Two-dimensional random projection
- Inferring sparse Gaussian graphical models with latent structure
- Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays
- Persistene in high-dimensional linear predictor-selection and the virtue of overparametrization
- LASSO for streaming data with adaptative filtering
- Understanding neural networks with reproducing kernel Banach spaces
- Stability of 1-bit compressed sensing in sparse data reconstruction
- Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis
- Backward elimination model construction for regression and classification using leave-one-out criteria
- An unbiased approach to compressed sensing
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Tutorial on Amortized Optimization
- A weighted randomized sparse Kaczmarz method for solving linear systems
- Statistical analysis of financial time series under the assumption of local stationarity
- Embedded feature-selection support vector machine for driving pattern recognition
- A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty
- Confidence intervals for low dimensional parameters in high dimensional linear models
- Adaptive Dantzig density estimation
- Model-based multiple rigid object detection and registration in unstructured range data
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- On the size of incoherent systems
- Sparse deconvolution using support vector machines
- Design of c-optimal experiments for high-dimensional linear models
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- Multiresolution approximation for volatility processes
- An automatic and parameter-free information-based method for sparse representation in wavelet bases
- Computing non-negative tensor factorizations
- Blind identification of fully observed linear time-varying systems via sparse recovery
- A general theory of singular values with applications to signal denoising
- Two dictionaries matching pursuit for sparse decomposition of signals
- Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction
- A generalized primal-dual algorithm with improved convergence condition for saddle point problems
- A convex optimization approach to filtering in jump linear systems with state dependent transitions
- A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit
- A parameterized proximal point algorithm for separable convex optimization
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- A gradient projection method for the sparse signal reconstruction in compressive sensing
- Sparse recovery under weak moment assumptions
- Regularity properties for sparse regression
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
- Geometric separation by single-pass alternating thresholding
- Best subset selection, persistence in high-dimensional statistical learning and optimization under l₁ constraint
- The trimmed Lasso: sparse recovery guarantees and practical optimization by the generalized soft-min penalty
- Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
- High-dimensional graphs and variable selection with the Lasso
- A remark on compressed sensing
- On constrained and regularized high-dimensional regression
- On the Algorithmic Power of Spiking Neural Networks
- High resolution pursuit for feature extraction
- Solution paths for the generalized Lasso with applications to spatially varying coefficients regression
- Convolutional neural networks analyzed via convolutional sparse coding
- \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve)
- Resilient control of cyber-physical systems using adaptive super-twisting observer
- Cardinality minimization, constraints, and regularization: a survey
- Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization
- Sparse Bayesian learning for network structure reconstruction based on evolutionary game data
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
- Weighted SGD for \(\ell_p\) regression with randomized preconditioning
- Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- A duality approach to regularized learning problems in Banach spaces
- Online sequential echo state network with sparse RLS algorithm for time series prediction
- An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- Spark-level sparsity and the \(\ell_1\) tail minimization
- A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding
- Dictionary evaluation and optimization for sparse coding based speech processing
- A general null space property for sparse principal component analysis
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints
- A noise-robust online convolutional coding model and its applications to Poisson denoising and image fusion
- A perturbation view of level-set methods for convex optimization
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- Computationally Efficient Atomic Representations for Nonstationary Stochastic Processes
- Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization
This page was built for publication: Atomic decomposition by basis pursuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706429)
