Sparse Approximate Solutions to Linear Systems
From MaRDI portal
Publication:4834376
DOI10.1137/S0097539792240406zbMath0827.68054WikidataQ56688857 ScholiaQ56688857MaRDI QIDQ4834376
Publication date: 13 December 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items
Unnamed Item ⋮ Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity ⋮ Fluorescence image deconvolution microscopy via generative adversarial learning (FluoGAN) ⋮ Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm ⋮ A smoothing inertial neural network for sparse signal reconstruction with noise measurements via \(L_p-L_1\) minimization ⋮ Grouped variable selection with discrete optimization: computational and statistical perspectives ⋮ Weak and strong convergence analysis of Elman neural networks via weight decay regularization ⋮ Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints ⋮ Simultaneous feature selection and outlier detection with optimality guarantees ⋮ On sparse approximations of solutions to linear systems with orthogonal matrices ⋮ Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model ⋮ Solution sets of three sparse optimization problems for multivariate regression ⋮ Sparse reconstruction via the mixture optimization model with iterative support estimate ⋮ A Critical Review of LASSO and Its Derivatives for Variable Selection Under Dependence Among Covariates ⋮ A nonlinear kernel SVM Classifier via \(L_{0/1}\) soft-margin loss with classification performance ⋮ A communication-efficient method for ℓ0 regularization linear regression models ⋮ Neural network for a class of sparse optimization with \(L_0\)-regularization ⋮ Sparse signal reconstruction via recurrent neural networks with hyperbolic tangent function ⋮ Neurodynamic approaches for sparse recovery problem with linear inequality constraints ⋮ Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization ⋮ Time‐optimal L1/L2 norms optimal control for linear time‐invariant systems ⋮ A unifying framework for sparsity-constrained optimization ⋮ Sparse convex optimization toolkit: a mixed-integer framework ⋮ Comparing different stabilization strategies for reduced order modeling of viscoelastic fluid flow problems ⋮ Proximal variable metric method with spectral diagonal update for large scale sparse optimization ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery ⋮ Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint ⋮ Support Recovery and Parameter Identification of Multivariate ARMA Systems with Exogenous Inputs ⋮ Sorted \(L_1/L_2\) minimization for sparse signal recovery ⋮ A wonderful triangle in compressed sensing ⋮ Discovering interpretable elastoplasticity models via the neural polynomial method enabled symbolic regressions ⋮ Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing ⋮ A neurodynamic algorithm for sparse signal reconstruction with finite-time convergence ⋮ Sparse control for continuous‐time systems ⋮ \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery ⋮ LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing ⋮ An automated exact solution framework towards solving the logistic regression best subset selection problem ⋮ Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection ⋮ A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization ⋮ A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm ⋮ A reduced half thresholding algorithm ⋮ Sparse regression for data-driven deterrence functions in gravity models ⋮ Robust amplitude method with \(L_{1/2}\)-regularization for compressive phase retrieval ⋮ A majorization penalty method for SVM with sparse constraint ⋮ Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing ⋮ A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion ⋮ A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems ⋮ On sparsity‐inducing methods in system identification and state estimation ⋮ Scaled proximal gradient methods for sparse optimization problems ⋮ Identifying stochastic governing equations from data of the most probable transition trajectories ⋮ Hierarchical ensemble Kalman methods with sparsity-promoting generalized gamma hyperpriors ⋮ Subset Selection and the Cone of Factor-Width-k Matrices ⋮ Representation recovery via \(L_1\)-norm minimization with corrupted data ⋮ Unnamed Item ⋮ An unbiased approach to compressed sensing ⋮ An Inexact Projected Gradient Method for Sparsity-Constrained Quadratic Measurements Regression ⋮ Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators ⋮ A tree-based dictionary learning framework ⋮ Convex Optimization for Group Feature Selection in Networked Data ⋮ Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent ⋮ Scalable Algorithms for the Sparse Ridge Regression ⋮ Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing ⋮ The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty ⋮ A Scale-Invariant Approach for Sparse Signal Recovery ⋮ Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems ⋮ Sparse reconstructions from few noisy data: analysis of hierarchical Bayesian models with generalized gamma hyperpriors ⋮ Random Projections for Linear Programming ⋮ Sparse System Identification in Pairs of Pulse and Takenaka--Malmquist Bases ⋮ Unnamed Item ⋮ Nonconvex Optimization for 3-Dimensional Point Source Localization Using a Rotating Point Spread Function ⋮ Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms ⋮ Uniqueness Conditions for A Class of ℓ0-Minimization Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sampling in Image Representation and Compression ⋮ Optimal Diversification in the Presence of Parameter Uncertainty for a Risk Averse Investor ⋮ Supervised pre-clustering for sparse regression ⋮ Unnamed Item ⋮ Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms ⋮ Deterministic convergence analysis via smoothing group Lasso regularization and adaptive momentum for Sigma-Pi-Sigma neural network ⋮ NP-hardness and inapproximability of sparse PCA ⋮ Efficient projection algorithms onto the weighted \(\ell_1\) ball ⋮ Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization ⋮ GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee ⋮ A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks ⋮ Clustering, multicollinearity, and singular vectors ⋮ Sparse signal recovery via generalized Gaussian function ⋮ The use of grossone in elastic net regularization and sparse support vector machines ⋮ The backbone method for ultra-high dimensional sparse machine learning ⋮ Polarization in cooperative networks through optimal placement of informed agents ⋮ A new bound on the block restricted isometry constant in compressed sensing ⋮ A solution approach for cardinality minimization problem based on fractional programming ⋮ CLOT norm minimization for continuous hands-off control ⋮ Smoothing inertial projection neural network for minimization \(L_{p-q}\) in sparse signal reconstruction ⋮ Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays ⋮ Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion ⋮ Transformed \(\ell_1\) regularization for learning sparse deep neural networks ⋮ Strengthening hash families and compressive sensing ⋮ Sparsity driven people localization with a heterogeneous network of cameras ⋮ An improved total variation regularized RPCA for moving object detection with dynamic background ⋮ Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm ⋮ A smoothing method for sparse optimization over convex sets ⋮ A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball ⋮ Analysis non-sparse recovery for relaxed ALASSO ⋮ Dynamic behavior analysis via structured rank minimization ⋮ Deterministic construction of compressed sensing matrices from constant dimension codes ⋮ Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction ⋮ Effective zero-norm minimization algorithms for noisy compressed sensing ⋮ Accelerated linearized Bregman method ⋮ Sparse signal recovery via ECME thresholding pursuits ⋮ Compressive isogeometric analysis ⋮ Nonconvex optimization for robust tensor completion from grossly sparse observations ⋮ Some greedy algorithms for sparse polynomial chaos expansions ⋮ Sparse regression: scalable algorithms and empirical performance ⋮ Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons ⋮ The complexity results of the sparse optimization problems and reverse convex optimization problems ⋮ Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing ⋮ A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness ⋮ Restricted strong convexity implies weak submodularity ⋮ Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization ⋮ Matrix recipes for hard thresholding methods ⋮ The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement ⋮ Convergence of projected Landweber iteration for matrix rank minimization ⋮ Fast thresholding algorithms with feedbacks for sparse signal recovery ⋮ Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO ⋮ Sparse approximate reconstruction decomposed by two optimization problems ⋮ Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method ⋮ Analysis of the self projected matching pursuit algorithm ⋮ Salt and pepper noise removal based on an approximation of \(l_0\) norm ⋮ Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes ⋮ Surrogate optimization for \(p\)-norms ⋮ An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem ⋮ Complexity and applications of the homotopy principle for uniformly constrained sparse minimization ⋮ On rank awareness, thresholding, and MUSIC for joint sparse recovery ⋮ Recovery of seismic wavefields by an \(l_{q}\)-norm constrained regularization method ⋮ Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem ⋮ Optimization problems for machine learning: a survey ⋮ Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach ⋮ Recovering low-rank and sparse matrix based on the truncated nuclear norm ⋮ An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series ⋮ Convergent inexact penalty decomposition methods for cardinality-constrained problems ⋮ A novel detection scheme with multiple observations for sparse signal based on likelihood ratio test with sparse estimation ⋮ The horseshoe-like regularization for feature subset selection ⋮ Structured overcomplete sparsifying transform learning with convergence guarantees and applications ⋮ Subspace quadratic regularization method for group sparse multinomial logistic regression ⋮ A new sparse recovery method for the inverse acoustic scattering problem ⋮ Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations ⋮ An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization ⋮ A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images ⋮ Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling ⋮ Sparse approximate solutions to max-plus equations ⋮ The sparsest solution of the union of finite polytopes via its nonconvex relaxation ⋮ Nonsmooth sparsity constrained optimization problems: optimality conditions ⋮ Deterministic constructions of compressed sensing matrices based on codes ⋮ Reconstruction of jointly sparse vectors via manifold optimization ⋮ On the computational complexity of the secure state-reconstruction problem ⋮ Optimality conditions for rank-constrained matrix optimization ⋮ Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration ⋮ Sparse classification: a scalable discrete optimization perspective ⋮ IDPCNN: iterative denoising and projecting CNN for MRI reconstruction ⋮ Robust subset selection ⋮ New bounds for subset selection from conic relaxations ⋮ Sparse radial basis function approximation with spatially variable shape parameters ⋮ Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs ⋮ Nonparametric regression with modified ReLU networks ⋮ Variable selection in convex quantile regression: \(\mathcal{L}_1\)-norm or \(\mathcal{L}_0\)-norm regularization? ⋮ Commonsense explanations of sparsity, Zipf law, and Nash's bargaining solution ⋮ A Lagrange-Newton algorithm for sparse nonlinear programming ⋮ A smoothed \(l_0\)-norm and \(l_1\)-norm regularization algorithm for computed tomography ⋮ Sparse regression at scale: branch-and-bound rooted in first-order optimization ⋮ Convex optimization under combinatorial sparsity constraints ⋮ Proof methods for robust low-rank matrix recovery ⋮ Sparse recovery of sound fields using measurements from moving microphones ⋮ An asymptotic existence result on compressed sensing matrices ⋮ Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints ⋮ Do semidefinite relaxations solve sparse PCA up to the information limit? ⋮ The sparsest solution to the system of absolute value equations ⋮ Ideal formulations for constrained convex optimization problems with indicator variables ⋮ Sparse representation of vectors in lattices and semigroups ⋮ Combining a relaxed EM algorithm with Occam's razor for Bayesian variable selection in high-dimensional regression ⋮ Best subset selection via a modern optimization lens ⋮ Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations ⋮ MOEA/D with chain-based random local search for sparse optimization ⋮ Operator theoretic framework for optimal placement of sensors and actuators for control of nonequilibrium dynamics ⋮ Local search methods for \(\ell_{1}\)-minimization in frame based signal compression ⋮ Near-ideal model selection by \(\ell _{1}\) minimization ⋮ Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios ⋮ Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\) ⋮ Sparse solutions of linear complementarity problems ⋮ Global optimization for low-dimensional switching linear regression and bounded-error estimation ⋮ DC approximation approaches for sparse optimization ⋮ Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems ⋮ The non-convex sparse problem with nonnegative constraint for signal reconstruction ⋮ Matrix sparsification and the sparse null space problem ⋮ \(l_1\)-\(l_2\) regularization of split feasibility problems ⋮ Quasi-interpolation and outliers removal ⋮ Sparse approximation is provably hard under coherent dictionaries ⋮ Regularity properties of non-negative sparsity sets ⋮ Checking strict positivity of Kraus maps is NP-hard ⋮ 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\) ⋮ Best subset binary prediction ⋮ ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals ⋮ Some optimization problems on ranks and inertias of matrix-valued functions subject to linear matrix equation restrictions ⋮ A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ Optimality condition and complexity of order-value optimization problems and low order-value optimization problems ⋮ Sparsity and spectral properties of dual frames ⋮ Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing ⋮ An improved algorithm for the \(L_2-L_p\) minimization problem ⋮ Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm ⋮ A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery ⋮ Efficient nonconvex sparse group feature selection via continuous and discrete optimization ⋮ Restricted normal cones and sparsity optimization with affine constraints ⋮ Remote sensing via \(\ell_1\)-minimization ⋮ Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization ⋮ Model-based multiple rigid object detection and registration in unstructured range data ⋮ Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization ⋮ Restricted isometries for partial random circulant matrices ⋮ Recovery of sparsest signals via \(\ell^q \)-minimization ⋮ Sparse conjugate directions pursuit with application to fixed-size kernel models ⋮ An approximation theory of matrix rank minimization and its application to quadratic equations ⋮ Phase transitions for greedy sparse approximation algorithms ⋮ A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery ⋮ General nonexact oracle inequalities for classes with a subexponential envelope ⋮ Weak fault detection of tapered rolling bearing based on penalty regularization approach ⋮ A note on the complexity of \(L _{p }\) minimization ⋮ Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework ⋮ An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration ⋮ Sparse Markowitz portfolio selection by using stochastic linear complementarity approach ⋮ Robust missing traffic flow imputation considering nonnegativity and road capacity ⋮ Median filter based compressed sensing model with application to MR image reconstruction ⋮ An adaptive gradient projection algorithm for piecewise convex optimization and its application in compressed spectrum sensing ⋮ Analysis sparse representation for nonnegative signals based on determinant measure by DC programming ⋮ Robust face recognition via block sparse Bayesian learning ⋮ On the conditioning of random subdictionaries ⋮ A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem ⋮ Efficient projected gradient methods for cardinality constrained optimization ⋮ Maximal solutions of sparse analysis regularization ⋮ Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\) ⋮ Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing ⋮ Minimal zero norm solutions of linear complementarity problems ⋮ Sparse dual frames and dual Gabor functions of minimal time and frequency supports ⋮ The road to deterministic matrices with the restricted isometry property ⋮ Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications ⋮ An overview on the applications of matrix theory in wireless communications and signal processing ⋮ On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing ⋮ Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) ⋮ Learning semidefinite regularizers ⋮ Measuring and moderating opinion polarization in social networks ⋮ Fast L1-L2 minimization via a proximal operator ⋮ Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R ⋮ Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\) ⋮ On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery ⋮ Interpreting latent variables in factor models via convex optimization ⋮ A probabilistic learning algorithm for robust modeling using neural networks with random weights ⋮ DC formulations and algorithms for sparse optimization problems ⋮ Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing ⋮ Dictionary evaluation and optimization for sparse coding based speech processing ⋮ Optimality analysis on partial \(l_1\)-minimization recovery ⋮ Sparse decomposition by iterating Lipschitzian-type mappings ⋮ Matrix completion under interval uncertainty ⋮ Sparse recovery under weak moment assumptions ⋮ An iteratively approximated gradient projection algorithm for sparse signal reconstruction ⋮ Identification of switched linear systems via sparse optimization ⋮ Convergence of fixed-point continuation algorithms for matrix rank minimization ⋮ Fixed point and Bregman iterative methods for matrix rank minimization ⋮ Sparse approximate solution of partial differential equations ⋮ When do stepwise algorithms meet subset selection criteria? ⋮ Iterative thresholding for sparse approximations ⋮ Analysis of basis pursuit via capacity sets ⋮ Image reconstruction for diffuse optical tomography based on radiative transfer equation ⋮ A note on sparse solutions of sparse linear systems ⋮ GPU accelerated greedy algorithms for compressed sensing ⋮ Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) ⋮ Column subset selection via sparse approximation of SVD ⋮ Sparse solutions to underdetermined Kronecker product systems ⋮ A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation ⋮ On solutions of sparsity constrained optimization ⋮ Sparse approximate multiquadric interpolation ⋮ Block Bregman Majorization Minimization with Extrapolation ⋮ Sparsity constrained optimization problems via disjunctive programming ⋮ Sparse index tracking using sequential Monte Carlo ⋮ Optimizing Sparsity over Lattices and Semigroups ⋮ On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables ⋮ Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing ⋮ LEARNING AN ADAPTIVE DICTIONARY USING A PROJECTED GRADIENT METHOD AND ITS APPLICATION ON IMAGE DE-NOISING ⋮ A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems ⋮ Entropic Regularization of the ℓ 0 Function ⋮ Identifying small mean-reverting portfolios ⋮ Sparse Representation for Sampled-Data $$H^\infty $$ Filters ⋮ Relaxed leverage sampling for low-rank matrix completion ⋮ A General Framework of Rotational Sparse Approximation in Uncertainty Quantification ⋮ Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging ⋮ Book Review: A mathematical introduction to compressive sensing ⋮ Global optimization for sparse solution of least squares problems ⋮ A penalty decomposition approach for multi-objective cardinality-constrained optimization problems ⋮ Cross validation in sparse linear regression with piecewise continuous nonconvex penalties and its acceleration ⋮ An efficient augmented Lagrangian method with applications to total variation minimization ⋮ An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems ⋮ Structured Sparsity: Discrete and Convex Approaches ⋮ Distributed Block Coordinate Descent for Minimizing Partially Separable Functions ⋮ Approximation Bounds for Some Sparse Kernel Regression Algorithms ⋮ Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles ⋮ Deterministic construction of compressed sensing matrices with characters over finite fields ⋮ Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee ⋮ A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem ⋮ Approximation Bounds for Sparse Programs ⋮ Minimizing L 1 over L 2 norms on the gradient ⋮ A theoretical result of sparse signal recovery via alternating projection method ⋮ Compressed sensing for finite-valued signals ⋮ Low-rank and joint-sparse signal recovery using sparse Bayesian learning in a WBAN ⋮ When does OMP achieve exact recovery with continuous dictionaries? ⋮ Improved RIP conditions for compressed sensing with coherent tight frames ⋮ Smoothing strategy along with conjugate gradient algorithm for signal reconstruction ⋮ A novel regularization based on the error function for sparse recovery ⋮ An inexact continuation accelerated proximal gradient algorithm for lown-rank tensor recovery ⋮ An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model ⋮ Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields ⋮ Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing ⋮ Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems ⋮ Stable Image Reconstruction Using Transformed Total Variation Minimization ⋮ The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing ⋮ Improved bounds for the RIP of Subsampled Circulant matrices ⋮ A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems ⋮ RNLp: mixing nonlocal and TV-Lp methods to remove impulse noise from images ⋮ A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection ⋮ Unnamed Item ⋮ Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation ⋮ A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing ⋮ On optimal solutions of the constrained ℓ 0 regularization and its penalty problem ⋮ CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion ⋮ Proximal Mapping for Symmetric Penalty and Sparsity ⋮ Compressive Sensing ⋮ On sparse recovery algorithms in unions of orthonormal bases ⋮ Uniqueness in nuclear norm minimization: flatness of the nuclear norm sphere and simultaneous polarization ⋮ Complexity of unconstrained \(L_2 - L_p\) minimization ⋮ Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit ⋮ Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets ⋮ Concentration of the Frobenius Norm of Generalized Matrix Inverses ⋮ A note on the hardness of sparse approximation ⋮ A note on sparse least-squares regression ⋮ An Introduction to Compressed Sensing ⋮ Unnamed Item ⋮ Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration ⋮ Sparse approximation based on a random overcomplete basis ⋮ Supervised 2-Phase Segmentation of Porous Media with Known Porosity ⋮ Optimal design of experiments for estimating the time of death in forensic medicine ⋮ Adapting Regularized Low-Rank Models for Parallel Architectures ⋮ Unnamed Item ⋮ The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). ⋮ A polynomial algorithm for best-subset selection problem ⋮ Complexity of penalized likelihood estimation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis ⋮ Learning Optimal Personalized Treatment Rules in Consideration of Benefit and Risk: With an Application to Treating Type 2 Diabetes Patients With Insulin Therapies ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Sparse PCA: Convex Relaxations, Algorithms and Applications ⋮ Nonconvex sorted \(\ell_1\) minimization for sparse approximation ⋮ Approximate message passing for nonconvex sparse regularization with stability and asymptotic analysis ⋮ Fractional minimal rank ⋮ Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction ⋮ Deterministic Construction of Compressed Sensing Matrices from Codes ⋮ Fast Implementation of ℓ 1-Greedy Algorithm ⋮ Detecting and Repairing Arbitrage in Traded Option Prices ⋮ Sparse Convex Regression ⋮ Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model ⋮ Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization ⋮ Kernel Least-Squares Models Using Updates of the Pseudoinverse ⋮ Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nonconvex-TV Based Image Restoration with Impulse Noise Removal ⋮ Unnamed Item ⋮ An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model *
