From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
From MaRDI portal
(Redirected from Publication:3614217)
Recommendations
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- Stable signal recovery from incomplete and inaccurate measurements
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- scientific article; zbMATH DE number 6797621
- On sparse solutions of underdetermined linear systems
Cited in
(only showing first 100 items - show all)- A simple test to check the optimality of a sparse signal approximation
- Sparse solutions to underdetermined Kronecker product systems
- The Little Engine that Could: Regularization by Denoising (RED)
- Convex optimization of measurement allocation for magnetic tracking systems
- Equiangular tight frames that contain regular simplices
- Prior model identification during subsurface flow data integration with adaptive sparse representation techniques
- The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- Sparse causality network retrieval from short time series
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- A two-level method for sparse time-frequency representation of multiscale data
- Entropy dimension reduction method for randomized machine learning problems
- The nonlocal sparse reconstruction algorithm by similarity measurement with shearlet feature vector
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
- Total variation image restoration method based on subspace optimization
- Analysis sparse representation for nonnegative signals based on determinant measure by DC programming
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- On Glowinski's open question on the alternating direction method of multipliers
- Blind identification of fully observed linear time-varying systems via sparse recovery
- Learning semidefinite regularizers
- DC formulations and algorithms for sparse optimization problems
- Dictionary evaluation and optimization for sparse coding based speech processing
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach
- Sparse feedback design in discrete-time linear systems
- An efficient algorithm for learning dictionary under coherence constraint
- Learning sparse FRAME models for natural image patterns
- Structured overcomplete sparsifying transform learning with convergence guarantees and applications
- The problem of sparse image coding
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography
- Sparse signal recovery via ECME thresholding pursuits
- Restricted \(p\)-isometry properties of partially sparse signal recovery
- Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem
- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
- A proximal fully parallel splitting method for stable principal component pursuit
- Sparse power factorization: balancing peakiness and sample complexity
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares
- A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing
- A second-order adaptive Douglas-Rachford dynamic method for maximal \(\alpha\)-monotone operators
- An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing
- A modulus-based iterative method for sparse signal recovery
- A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization
- Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration
- Overcomplete representation in a hierarchical Bayesian framework
- Ensemble Kalman inversion for sparse learning of dynamical systems from time-averaged data
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- Sparse regularization via bidualization
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
- Model recovery for multi-input signal-output nonlinear systems based on the compressed sensing recovery theory
- Stable high-order cubature formulas for experimental data
- A survey on some recent developments of alternating direction method of multipliers
- A truncated Newton algorithm for nonconvex sparse recovery
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
- A hybrid quasi-Newton method with application in sparse recovery
- Gradient projection Newton pursuit for sparsity constrained optimization
- The springback penalty for robust signal recovery
- A solution approach for cardinality minimization problem based on fractional programming
- Simple structures in problems of control theory: formalization and synthesis
- Randomization and entropy in machine learning and data processing
- Global sensitivity analysis for multivariate outputs using polynomial chaos-based surrogate models
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- A note on the spectral gradient projection method for nonlinear monotone equations with applications
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
- A smoothing method for sparse optimization over convex sets
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- A perturbation analysis of nonconvex block-sparse compressed sensing
- A Barzilai-Borwein gradient projection method for sparse signal and blurred image restoration
- The effect of perturbations of frames and fusion frames on their redundancies
- A safe reinforced feature screening strategy for Lasso based on feasible solutions
- A two-stage method for spectral-spatial classification of hyperspectral images
- Autoregressive identification of Kronecker graphical models
- Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- Signal separation under coherent dictionaries and _p-bounded noise
- On constrained optimization with nonconvex regularization
- The complexity results of the sparse optimization problems and reverse convex optimization problems
- A unifying representer theorem for inverse problems and machine learning
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- An alternating direction method of multipliers for tensor complementarity problems
- A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design
- Identification of alterations in the Jacobian of biochemical reaction networks from steady state covariance data at two conditions
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
- Data-driven time-frequency analysis
- Geometric separation by single-pass alternating thresholding
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Convergence of a data-driven time-frequency analysis method
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- Alternating direction method for covariance selection models
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- A first approach to learning a best basis for gravitational field modelling
- An offline/online procedure for dual norm calculations of parameterized functionals: empirical quadrature and empirical test spaces
- A new generalized projection and its application to acceleration of audio declipping
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- Data-driven compressive sensing and applications in uncertainty quantification
This page was built for publication: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614217)
