PDCO

swMATH5148MaRDI QIDQ17288FDOQ17288

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
• Spectral Compressed Sensing via Projected Gradient Descent
• Parsimonious additive models
• PROMP: a sparse recovery approach to lattice-valued signals
• Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
• Two-dimensional random projection
• Discussion: ``A significance test for the lasso
• Discussion: ``A significance test for the lasso
• Discussion: ``A significance test for the lasso
• Discussion: ``A significance test for the lasso
• Approximate Minimization of the Regularized Expected Error over Kernel Models
• Learning semidefinite regularizers
• On the efficiency of the orthogonal matching pursuit in compressed sensing
• Geometric separation by single-pass alternating thresholding
• Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
• A Bayesian lasso via reversible-jump MCMC
• Nonconvex sorted \(\ell_1\) minimization for sparse approximation
• Incrementally updated gradient methods for constrained and regularized optimization
• Compressed sensing for finite-valued signals
• An adaptive primal-dual framework for nonsmooth convex minimization
• Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
• Source localization using a sparse representation framework to achieve superresolution
• Lagrangian-penalization algorithm for constrained optimization and variational inequalities
• An adaptive gradient projection algorithm for piecewise convex optimization and its application in compressed spectrum sensing
• Proximal methods for the latent group lasso penalty
• Discussion: Time-threshold maps: using information from wavelet reconstructions with all threshold values simultaneously
• Rejoinder: Time-threshold maps: using information from wavelet reconstructions with all threshold values simultaneously
• 2DPCA with L1-norm for simultaneously robust and sparse modelling
• An infeasible-point subgradient method using adaptive approximate projections
• Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients
• Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy
• A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
• First-order optimality condition of basis pursuit denoise problem
• A Least-Squares Method for Sparse Low Rank Approximation of Multivariate Functions
• Projected Landweber iteration for matrix completion
• Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
• Robust face recognition via block sparse Bayesian learning
• Sparse time-frequency representation of nonlinear and nonstationary data
• A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization
• Deterministic construction of sparse binary matrices via incremental integer optimization
• Adaptive algorithms for sparse system identification
• A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
• Sparse dual frames and dual Gabor functions of minimal time and frequency supports
• Fast global convergence of gradient methods for high-dimensional statistical recovery
• High-dimensional inference in misspecified linear models
• A Barzilai-Borwein type method for minimizing composite functions
• Compressive sensing using chaotic sequence based on Chebyshev map
• Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging
• An Adaptive Generalized Multiscale Discontinuous Galerkin Method for High-Contrast Flow Problems
• Density-ratio matching under the Bregman divergence: a unified framework of density-ratio estimation
• Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing
• On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
• Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework
• A modified greedy analysis pursuit algorithm for the cosparse analysis model
• Sparse decomposition by iterating Lipschitzian-type mappings
• Image reconstruction using analysis model prior
• Data based identification and prediction of nonlinear and complex dynamical systems
• Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems
• An efficient descent method for locally Lipschitz multiobjective optimization problems
• Spectral dynamics and regularization of incompletely and irregularly measured data
• Globally sparse and locally dense signal recovery for compressed sensing
• Extensions of Gauss quadrature via linear programming
• Sparse Representation of Signals in Hardy Space
• Estimation in High Dimensions: A Geometric Perspective
• New methods for fitting multiple sinusoids from irregularly sampled data
• Robust sparse recovery via a novel convex model
• A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
• Nonparametric denoising of signals of unknown local structure. II: Nonparametric function recovery
• Processing MUSE hyperspectral data: denoising, deconvolution and detection of astrophysical sources
• On the uniqueness of solutions for the basis pursuit in the continuum
• Title not available (Why is that?)
• Regularization of geophysical ill-posed problems by iteratively re-weighted and refined least squares
• A short note on compressed sensing with partially known signal support
• Estimation of block sparsity in compressive sensing
• Gradient-based method with active set strategy for $\ell _1$ optimization
• Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee
• New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints
• Enhancing sparsity of Hermite polynomial expansions by iterative rotations
• Positive shrinkage, improved pretest and absolute penalty estimators in partially linear models
• A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization
• Analysis of basis pursuit via capacity sets
• Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference
• New cyclic sparsity measures for deconvolution based on convex relaxation
• Sparse recovery via differential inclusions
• On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
• Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• Compression and denoising using \(l _{0}\)-norm
• An efficient privacy-preserving compressive data gathering scheme in WSNs
• Preserving injectivity under subgaussian mappings and its application to compressed sensing
• The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
• Theoretical guarantees for graph sparse coding
• Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
• Basis adaptive sample efficient polynomial chaos (BASE-PC)
• A proximal alternating linearization method for minimizing the sum of two convex functions
• Feature selection for high-dimensional data
• Fast thresholding algorithms with feedbacks for sparse signal recovery
• Sampling from non-smooth distributions through Langevin diffusion
• Signal recovery under mutual incoherence property and oracle inequalities
• Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification

This page was built for software: PDCO