Enhancing sparsity by reweighted \(\ell _{1}\) minimization

From MaRDI portal

Revision as of 11:19, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:734955

Jump to:navigation, search

DOI10.1007/s00041-008-9045-xzbMath1176.94014arXiv0711.1612WikidataQ56688960 ScholiaQ56688960MaRDI QIDQ734955

Michael B. Wakin, Emmanuel J. Candès, Stephen P. Boyd

Publication date: 14 October 2009

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.1612

zbMATH Keywords

iterative algorithm; image processing; magnetic resonance imaging; signal theory; error correction; statistical estimation; sparsity; compressive sensing; majorization-minimization algorithm; \(\ell_1\) minimization; sparse signal recovery; weighted \(\ell_1\) minimization

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

94A12: Signal theory (characterization, reconstruction, filtering, etc.)

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory

Related Items

OSQP: An Operator Splitting Solver for Quadratic Programs, A unified approach to model selection and sparse recovery using regularized least squares, Analysis of a nonsmooth optimization approach to robust estimation, Entropy function-based algorithms for solving a class of nonconvex minimization problems, Adaptive identification of linear systems subject to Gross errors, Best subset selection via a modern optimization lens, Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem, A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron, Accelerated compressed sensing based CT image reconstruction, DC approximation approaches for sparse optimization, Controller architectures: tradeoffs between performance and structure, Sharp MSE bounds for proximal denoising, Image denoising by generalized total variation regularization and least squares fidelity, Nodes selection strategy in cooperative tracking problem, 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory, Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations, A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions, The essential ability of sparse reconstruction of different compressive sensing strategies, Reweighted minimization model for MR image reconstruction with split Bregman method, Nonconvex compressed sampling of natural images and applications to compressed MR imaging, Manifold elastic net: a unified framework for sparse dimension reduction, Sparse occlusion detection with optical flow, Recovery of sparsest signals via \(\ell^q \)-minimization, A majorization-minimization approach to the sparse generalized eigenvalue problem, Smoothed state estimates under abrupt changes using sum-of-norms regularization, Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization, A new TV-Stokes model with augmented Lagrangian method for image denoising and deconvolution, A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection, Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming, Subband adaptive filtering with \(l_1\)-norm constraint for sparse system identification, A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization, Sparse dual frames and dual Gabor functions of minimal time and frequency supports, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, DCA based algorithms for feature selection in multi-class support vector machine, GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression, The sparsest solutions to \(Z\)-tensor complementarity problems, Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization, Observability for initial value problems with sparse initial data, Identification of switched linear systems via sparse optimization, Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms, A non-adapted sparse approximation of PDEs with stochastic inputs, Compressed sensing with coherent and redundant dictionaries, Adaptive algorithms for sparse system identification, Restoration of images based on subspace optimization accelerating augmented Lagrangian approach, A majorization-minimization approach to variable selection using spike and slab priors, Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\), Inferring stable genetic networks from steady-state data, Nonconvex TGV regularization model for multiplicative noise removal with spatially varying parameters, \(p\)-Laplace diffusion for distance function estimation, optimal transport approximation, and image enhancement, Nonconcave penalized composite conditional likelihood estimation of sparse Ising models, Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors, Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators, A chaotic iterative algorithm based on linearized Bregman iteration for image deblurring, Enhancing sparsity of Hermite polynomial expansions by iterative rotations, Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization, A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization, Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach, Group sparse optimization for learning predictive state representations, A theoretical understanding of self-paced learning, Enhanced joint sparsity via iterative support detection, Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery, Stable portfolio selection strategy for mean-variance-CVaR model under high-dimensional scenarios, Direction of arrival estimation via reweighted \(l_1\) norm penalty algorithm for monostatic MIMO radar, An enhanced logical benders approach for linear programs with complementarity constraints, Structured identification for network reconstruction of RC-models, Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations, Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm, Pruning of error correcting output codes by optimization of accuracy-diversity trade off, Comparison of parametric sparse recovery methods for ISAR image formation, SLOPE-adaptive variable selection via convex optimization, Iterative reweighted total generalized variation based Poisson noise removal model, Segmentation of ARX-models using sum-of-norms regularization, Estimating the dimension of a model, Sparse high-dimensional fractional-norm support vector machine via DC programming, A linearly convergent algorithm for sparse signal reconstruction, Tuning parameter selection in sparse regression modeling, Computation of sparse and dense equilibrium strategies of evolutionary games, Variable selection via generalized SELO-penalized linear regression models, Improved adaptive sparse channel estimation using mixed square/fourth error criterion, A new sensor selection scheme for Bayesian learning based sparse signal recovery in WSNs, Prior model identification during subsurface flow data integration with adaptive sparse representation techniques, Speckle noise reduction via nonconvex high total variation approach, Compressed sensing of data with a known distribution, Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions, Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP, Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression, Optimal network design for synchronization of coupled oscillators, An improved algorithm for the \(L_2-L_p\) minimization problem, A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery, Online fault diagnosis for nonlinear power systems, Genetic algorithm versus classical methods in sparse index tracking, \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization, Image denoising using combined higher order non-convex total variation with overlapping group sparsity, Weak fault detection of tapered rolling bearing based on penalty regularization approach, 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, Bound alternative direction optimization for image deblurring, Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC), Sparse signal reconstruction based on multiparameter approximation function with smoothed \(\ell_0\) norm, Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, Sparsity-Assisted Signal Smoothing, A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization, High Order Edge Sensors with $\ell^1$ Regularization for Enhanced Discontinuous Galerkin Methods, Sparse learning of partial differential equations with structured dictionary matrix, CHAOTIC ANALOG-TO-INFORMATION CONVERSION: PRINCIPLE AND RECONSTRUCTABILITY WITH PARAMETER IDENTIFIABILITY, Direct numerical simulation of high-speed transition due to roughness elements, A framework for optimal actuator/sensor selection in a control system, Zero‐attracting variable‐step‐size least mean square algorithms for adaptive sparse channel estimation, Phase Retrieval via Matrix Completion, Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization, The linearized alternating direction method of multipliers for low-rank and fused LASSO matrix regression model, Supervised-distributed control with joint performance and communication optimisation, Estimation and Uncertainty Quantification for Piecewise Smooth Signal Recovery, Exact penalization for cardinality and rank-constrained optimization problems via partial regularization, Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection, Orientation estimation of cryo-EM images using projected gradient descent method, A survey on compressive sensing: classical results and recent advancements, On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization, An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis, Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints, Nonconvex optimization with inertial proximal stochastic variance reduction gradient, High-dimensional sparse index tracking based on a multi-step convex optimization approach, Heuristics for Finding Sparse Solutions of Linear Inequalities, Sparse feedback stabilization in high‐order linear systems, Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints, Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning, Model selection via reweighted partial sparse recovery, Statistical Inference, Learning and Models in Big Data, Sparse reconstruction via the mixture optimization model with iterative support estimate, Sparse signal reconstruction via collaborative neurodynamic optimization, Neural network for a class of sparse optimization with \(L_0\)-regularization, Weighted sparsity regularization for source identification for elliptic PDEs, Variable selection in saturated and supersaturated designs via lp-lq minimization, Sparse and risk diversification portfolio selection, Doubly iteratively reweighted algorithm for constrained compressed sensing models, Derivative-based SINDy (DSINDy): addressing the challenge of discovering governing equations from noisy data, Proximal variable metric method with spectral diagonal update for large scale sparse optimization, Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum, Support Recovery and Parameter Identification of Multivariate ARMA Systems with Exogenous Inputs, Generalized Sparse Bayesian Learning and Application to Image Reconstruction, Sequential edge detection using joint hierarchical Bayesian learning, Impulse noise removal by using a nonconvex TGV regularizer and nonconvex fidelity, Simultaneous Identification and Denoising of Dynamical Systems, Inhomogeneous regularization with limited and indirect data, Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems, Spatial feature extraction non-negative tensor factorization for hyperspectral unmixing, Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm, Structured model selection via ℓ1−ℓ2 optimization, Wavelets in the deep learning era, Sequential image recovery using joint hierarchical Bayesian learning, Variational Convexity of Functions and Variational Sufficiency in Optimization, A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm, Saturation-value based higher-order regularization for color image restoration, A general adaptive ridge regression method for generalized linear models: an iterative re-weighting approach, Multi-period liability clearing via convex optimal control, A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program, PCA Sparsified, A Lorentzian-\(\ell_p\) norm regularization based algorithm for recovering sparse signals in two types of impulsive noise, Scaled proximal gradient methods for sparse optimization problems, Recent Theoretical Advances in Non-Convex Optimization, An adaptive gradient projection algorithm for piecewise convex optimization and its application in compressed spectrum sensing, Bayesian augmented Lagrangian algorithm for system identification, A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem, Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization, On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1\)], Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis, Sign function based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian noise environments, Reducing effects of bad data using variance based joint sparsity recovery, Block matching local SVD operator based sparsity and TV regularization for image denoising, Subspace-based spectrum estimation in innovation models by mixed norm minimization, A proximal difference-of-convex algorithm with extrapolation, Sparse signal recovery with prior information by iterative reweighted least squares algorithm, RTE-based parameter reconstruction with \(T V + L^1\) regularization, DC programming and DCA: thirty years of developments, Iterative reweighted methods for \(\ell _1-\ell _p\) minimization, Equivalent Lipschitz surrogates for zero-norm and rank optimization problems, Templates for convex cone problems with applications to sparse signal recovery, Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem, Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach, A truncation algorithm for minimizing the Frobenius-Schatten norm to find a sparse matrix, \(\ell_1\)- and \(\ell_2\)-norm joint regularization based sparse signal reconstruction scheme, Broken adaptive ridge regression and its asymptotic properties, Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization, Toward fast transform learning, A bimodal co-sparse analysis model for image processing, A logarithmic image prior for blind deconvolution, Sparsity driven people localization with a heterogeneous network of cameras, Multi-parametric solution-path algorithm for instance-weighted support vector machines, The adaptive and the thresholded Lasso for potentially misspecified models (and a lower bound for the Lasso), Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing, Side-information-induced reweighted sparse subspace clustering, Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems, Rapid compressed sensing reconstruction: a semi-tensor product approach, Iterative adaptive nonconvex low-rank tensor approximation to image restoration based on ADMM, A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization, Design of \(\mathcal H_2\) \((\mathcal H_\infty)\)-based optimal structured and sparse static output feedback gains, A support-denoiser-driven framework for single image restoration, Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares, Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations, A robust graph-based semi-supervised sparse feature selection method, Variational Bayesian inversion for the reaction coefficient in space-time nonlocal diffusion equations, New regularization method and iteratively reweighted algorithm for sparse vector recovery, A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem, Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case, An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems, Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods, Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems, The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization, Patch-based weighted SCAD prior for Rician noise removal, \(H_{\infty}\) observer-based control for large-scale systems with sparse observer communication network, Image retinex based on the nonconvex TV-type regularization, Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems, Partial gradient optimal thresholding algorithms for a class of sparse optimization problems, Weighted thresholding homotopy method for sparsity constrained optimization, Ensemble Kalman inversion for sparse learning of dynamical systems from time-averaged data, Non-convex fractional-order TV model for impulse noise removal, Hybrid non-convex regularizers model for removing multiplicative noise, Reweighted sparse unmixing for hyperspectral images with noise level estimation, A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration, SABRINA: a stochastic subspace majorization-minimization algorithm, GenMod: a generative modeling approach for spectral representation of PDEs with random inputs, Tucker-3 decomposition with sparse core array using a penalty function based on Gini-index, The proximity operator of the log-sum penalty, Conditionally exponential prior in focal near- and far-field EEG source localization via randomized multiresolution scanning (RAMUS), Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems, Efficient projection algorithms onto the weighted \(\ell_1\) ball, Estimation of dynamic systems using a method of characteristics filter, The inverse problem for conducting defective lattices, Neural network training using \(\ell_1\)-regularization and bi-fidelity data, A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal, Field of experts regularized nonlocal low rank matrix approximation for image denoising, A truncated Newton algorithm for nonconvex sparse recovery, A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems, Sequential image recovery from noisy and under-sampled Fourier data, Optimal co-designs of communication and control in bandwidth-constrained cyber-physical systems, Bias versus non-convexity in compressed sensing, An interior stochastic gradient method for a class of non-Lipschitz optimization problems, Gradient projection Newton pursuit for sparsity constrained optimization, A solution approach for cardinality minimization problem based on fractional programming, Cauchy noise removal by weighted nuclear norm minimization, Sparse solutions of optimal control via Newton method for under-determined systems, A nonconvex \(l_1 (l_1-l_2)\) model for image restoration with impulse noise, Separating variables to accelerate non-convex regularized optimization, Transformed \(\ell_1\) regularization for learning sparse deep neural networks, A sparse rank-1 approximation algorithm for high-order tensors, Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm, A smoothing method for sparse optimization over convex sets, Large-scale regression with non-convex loss and penalty, Bayesian robust principal component analysis with adaptive singular value penalty, A differential approach to shape from polarisation: a level-set characterisation, Weighted nuclear norm minimization and its applications to low level vision, Matrix completion with nonconvex regularization: spectral operators and scalable algorithms, Effective zero-norm minimization algorithms for noisy compressed sensing, Geological facies recovery based on weighted \(\ell_1\)-regularization, Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm, New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem, Non-convex total variation regularization for convex denoising of signals, On the asymptotic properties of SLOPE, Some greedy algorithms for sparse polynomial chaos expansions, Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation, Unnamed Item, Introduction, Unnamed Item, Unnamed Item, Sparsity Based Nonlocal Image Restoration: An Alternating Optimization Approach, Sparsity Constrained Estimation in Image Processing and Computer Vision, The Spike-and-Slab LASSO, Composite Difference-Max Programs for Modern Statistical Estimation Problems, Mixed H2/H∞-based actuator selection for uncertain polytopic systems with regional pole placement, Sparsest representations and approximations of an underdetermined linear system, A hierarchical Bayesian perspective on majorization-minimization for non-convex sparse regression: application to M/EEG source imaging, Multicompartment magnetic resonance fingerprinting, Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information, A null-space-based weightedl₁minimization approach to compressed sensing, Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations, Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification, Sparse Solutions in Optimal Control of PDEs with Uncertain Parameters: The Linear Case, Triangulated Surface Denoising using High Order Regularization with Dynamic Weights, Joint Sparse Recovery Based on Variances, Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity, Using automatic differentiation for compressive sensing in uncertainty quantification, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, Blind Source Separation with Outliers in Transformed Domains, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension, An algebra for periodic rhythms and scales, Decoupling noise and features via weighted ℓ ₁ -analysis compressed sensing, An ℓ<sub>q</sub>- Seminorm Variational Model for Impulse Noise Reduction, Computational approaches to non-convex, sparsity-inducing multi-penalty regularization, Recent trends and advances in solving the inverse problem for EEG source localization, Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model, Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark, Unnamed Item, On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms, One-bit compressed sensing via ℓ _p(0 < p < 1)-minimization method, ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal, A proximity moving horizon estimator for a class of nonlinear systems, Nonconvex Total Generalized Variation Model for Image Inpainting, An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^*, Proximal Gradient Methods with Adaptive Subspace Sampling, Geometry and Symmetry in Short-and-Sparse Deconvolution, Blind Identification of Stochastic Block Models from Dynamical Observations, Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization, Restoration of Poissonian Images Using Nonconvex Regularizer with Overlapping Group Sparsity, Efficient numerical methods to solve sparse linear equations with application to PageRank, Sampling-based Spotlight SAR Image Reconstruction from Phase History Data for Speckle Reduction and Uncertainty Quantification, A General Framework of Rotational Sparse Approximation in Uncertainty Quantification, A Unified Framework for Structured Graph Learning via Spectral Constraints, Adaptive and Implicit Regularization for Matrix Completion, Global optimization for sparse solution of least squares problems, Scalable Algorithms for Large Competing Risks Data, Unnamed Item, Unnamed Item, Sparse index clones via the sorted ℓ₁-Norm, Rates of convergence of the adaptive elastic net and the post-selection procedure in ultra-high dimensional sparse models, A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, Empirical Bayesian Inference Using a Support Informed Prior, Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, A Large-Scale Constrained Joint Modeling Approach for Predicting User Activity, Engagement, and Churn With Application to Freemium Mobile Games, Independently Interpretable Lasso for Generalized Linear Models, An unbiased approach to compressed sensing, Non-convex Optimization via Strongly Convex Majorization-minimization, A mathematical model for image saturation with an application to the restoration of solar images via adaptive sparse deconvolution, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, $l_p$ Regularization for Ensemble Kalman Inversion, Iteratively Reweighted Group Lasso Based on Log-Composite Regularization, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems, On phase retrieval via matrix completion and the estimation of low rank PSD matrices, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction, A Duality-Based Method for Identifying Elemental Balance Violations in Metabolic Network Models, A nonconvex penalization algorithm with automatic choice of the regularization parameter in sparse imaging, Non-Lipschitz Models for Image Restoration with Impulse Noise Removal, A Global Approach for Solving Edge-Matching Puzzles, Minimization of $\ell_{1-2}$ for Compressed Sensing, Portfolio Selection with Multiple Spectral Risk Constraints, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, Sparse Bayesian linear regression using generalized normal priors, Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm, A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, CURVELET-WAVELET REGULARIZED SPLIT BREGMAN ITERATION FOR COMPRESSED SENSING, A review on restoration of seismic wavefields based on regularization and compressive sensing, Design of structured dynamic output-feedback controllers for interconnected systems, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Sparse signal recovery by accelerated ℓ_q (0<q<1) thresholding algorithm, Recursive SURE for iterative reweighted least square algorithms, A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem, Optimal experimental design under irreducible uncertainty for linear inverse problems governed by PDEs, Randomization and Reweighted $\ell_1$-Minimization for A-Optimal Design of Linear Inverse Problems, Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation, Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: II. Solutions and applications, A smoothing majorization method for matrix minimization, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, Iteratively reweighted least squares minimization for sparse recovery, Hyper-Laplacian regularized nonlocal low-rank matrix recovery for hyperspectral image compressive sensing reconstruction, Bregman reweighted alternating minimization and its application to image deblurring, Bilateral filter based total variation regularization for sparse hyperspectral image unmixing, On constrained optimization with nonconvex regularization, Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization, On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression, A two-step iterative algorithm for sparse hyperspectral unmixing via total variation, A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise, A reweighted nuclear norm minimization algorithm for low rank matrix recovery, An approximate sparsity model for inpainting, From simple structure to sparse components: a review, Iterative reweighted noninteger norm regularizing SVM for gene expression data classification, A numerical exploration of compressed sampling recovery, Flexible GMRES for total variation regularization, Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\), Sensor selection strategies for state estimation in energy constrained wireless sensor networks, Empirical Bayesian learning in AR graphical models, A gradient descent based algorithm for \(\ell_p\) minimization, Analysis of compressed distributed adaptive filters, Numerical analysis for conservation laws using \(l_1\) minimization, A non-convex tensor rank approximation for tensor completion, Localization of mixed near-field and far-field multi-band sources based on sparse representation, Simultaneous stabilization of polynomial nonlinear systems via density functions, A new smoothed L0 regularization approach for sparse signal recovery, Superresolution 2D DOA estimation for a rectangular array via reweighted decoupled atomic norm minimization, An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization, Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem, Joint image compression-encryption scheme using entropy coding and compressive sensing, Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions, MRI denoising via sparse tensors with reweighted regularization, The modified second APG method for DC optimization problems, Detecting edges from non-uniform Fourier data via sparse Bayesian learning, Greedy Gaussian segmentation of multivariate time series, A consistent and numerically efficient variable selection method for sparse Poisson regression with applications to learning and signal recovery, Orthogonal matched wavelets with vanishing moments: a sparsity design approach, Block matching video compression based on sparse representation and dictionary learning, Norm penalized joint-optimization NLMS algorithms for broadband sparse adaptive channel estimation, A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method, A smoothed \(l_0\)-norm and \(l_1\)-norm regularization algorithm for computed tomography, A non-convex algorithm framework based on DC programming and DCA for matrix completion, Set membership identification of switched linear systems with known number of subsystems, Error analysis of reweighted \(l_1\) greedy algorithm for noisy reconstruction, Finding sparse solutions of systems of polynomial equations via group-sparsity optimization, Rank-one and sparse matrix decomposition for dynamic MRI, Constructing optimal sparse portfolios using regularization methods, A smoothing iterative method for quantile regression with nonconvex \(\ell_p\) penalty, Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration, Non-convex TV denoising corrupted by impulse noise, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, On the adaptive elastic net with a diverging number of parameters, Recovery error analysis of noisy measurement in compressed sensing, Total generalized variation based denoising models for ultrasound images, Variational image colorization models using higher-order Mumford-Shah regularizers, Low-complexity \(l_0\)-norm penalized shrinkage linear and widely linear affine projection algorithms, Sparsity-promoting optimal control of systems with symmetries, consensus and synchronization networks, Maximum entropy vector kernels for MIMO system identification, Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing, Sparse adaptive channel estimation based on mixed controlled \(l_2\) and \(l_p\)-norm error criterion, 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, Iteratively reweighted \(\ell _1\) algorithms with extrapolation, Correcting for unknown errors in sparse high-dimensional function approximation, Sparse Kalman filtering approaches to realized covariance estimation from high frequency financial data, Model identification of a network as compressing sensing, Multi-stage convex relaxation for feature selection, Partial \(S\)-goodness for partially sparse signal recovery, Sparse multi-scale diffeomorphic registration: the kernel bundle framework, Efficient nonsmooth nonconvex optimization for image restoration and segmentation, Nonconvex sorted \(\ell_1\) minimization for sparse approximation, Background subtraction with Kronecker-basis-representation based tensor sparsity and \(l_{1,1,2}\) norm, A novel regularization based on the error function for sparse recovery, Convergence and stability analysis of the half thresholding based few-view CT reconstruction, Multi-competitive viruses over time-varying networks with mutations and human awareness, Dynamic network reconstruction from heterogeneous datasets, Towards understanding sensor and control nodes selection in nonlinear dynamic systems: Lyapunov theory meets branch-and-bound, The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing, Newton-type optimal thresholding algorithms for sparse optimization problems, Proximal linearization methods for Schatten \(p\)-quasi-norm minimization, Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem, Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression, Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems, A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing, Alternating direction method of multipliers for nonconvex log total variation image restoration, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, Linear-step solvability of some folded concave and singly-parametric sparse optimization problems, Far Field Splitting by Iteratively Reweighted $\ell^1$ Minimization, Low Complexity Regularization of Linear Inverse Problems, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, Sparse set membership identification of nonlinear functions and application to fault detection, Reconstructing gas distribution maps via an adaptive sparse regularization algorithm, Fast Implementation of ℓ 1-Greedy Algorithm, A Common Network Architecture Efficiently Implements a Variety of Sparsity-Based Inference Problems, A COMPRESSED SENSING FRAMEWORK OF FREQUENCY-SPARSE SIGNALS THROUGH CHAOTIC SYSTEM, An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence, On sparse representation of analytic signal in Hardy space, A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery, Constraint matrix factorization for space variant PSFs field restoration, Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation, On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem, Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets

Uses Software

PDCO

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:734955&oldid=12643621"