Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
From MaRDI portal
Recommendations
- Group-Based Sparse Representation for Image Restoration
- Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation
- Group sparse representation for restoring blurred images with Cauchy noise
- Image restoration using total variation with overlapping group sparsity
- Group Sparsity Residual Constraint With Non-Local Priors for Image Restoration
- Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
- Truncated Nuclear Norm Minimization Based Group Sparse Representation for Image Restoration
- Restoration of Poissonian images using nonconvex regularizer with overlapping group sparsity
Cites work
- A continuous exact _0 penalty (CEL0) for least squares regularized problem
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A group bridge approach for variable selection
- A unified view of exact continuous penalties for _2-_0 minimization
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals
- Analysis of multi-stage convex relaxation for sparse regularization
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Best subset selection via a modern optimization lens
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Generalized alternating projection for weighted-\(\ell_{2,1}\) minimization with applications to model-based compressive sensing
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Group Sparse Recovery via the \ell ^0(\ell ^2) Penalty: Theory and Algorithm
- Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere
- Model Selection and Estimation in Regression with Grouped Variables
- Nonconvex optimization for 3-dimensional point source localization using a rotating point spread function
- On convex envelopes and regularization of non-convex functionals without moving global minima
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Optimality and complexity for constrained optimization problems with nonconvex regularization
- Optimization problems involving group sparsity terms
- Penalty methods for a class of non-Lipschitz optimization problems
- Probing the Pareto frontier for basis pursuit solutions
- Proximal methods for the latent group lasso penalty
- Sparse optimization for nonconvex group penalized estimation
- Sparse Reconstruction by Separable Approximation
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
- Subspace Methods for Joint Sparse Recovery
- The benefit of group sparsity
- The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
Cited in
(32)- A smoothing proximal gradient algorithm for matrix rank minimization problem
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Lifted stationary points of sparse optimization with complementarity constraints
- A greedy Newton-type method for multiple sparse constraint problem
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Truncated Nuclear Norm Minimization Based Group Sparse Representation for Image Restoration
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Solution sets of three sparse optimization problems for multivariate regression
- A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems
- A modification piecewise convexification method with a classification strategy for box-constrained non-convex optimization programs
- Estimation of sparse covariance matrix via non-convex regularization
- Generalized nonconvex hyperspectral anomaly detection via background representation learning with dictionary constraint
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- A generalized formulation for group selection via ADMM
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions
- Subspace Newton method for sparse group \(\ell_0\) optimization problem
- Non-negative sparse recovery via momentum-boosted adaptive thresholding algorithm
- Smoothing proximal gradient block-coordinate algorithms for group sparse _0 regularized nonsmooth convex regression problem
- Nonconvex regularizer and homotopy-based sparse optimization: convergent algorithms and applications
- Efficient low rank matrix recovery with flexible group sparse regularization
- Computing the proximal operator of the \(q\)-th power of the \(\ell_{1,q} \)-norm for group sparsity
- Tensor robust principal component analysis based on a two-layer Tucker rank minimization model
- Optimality conditions for non-negative group sparse constrained optimization problems
- Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application
- Group sparse optimization for inpainting of random fields on the sphere
- A general framework for group sparsity in hyperspectral unmixing using endmember bundles
- Optimality conditions for group sparsity constrained optimization problems with equality and inequality constraints
- Spectral-spatial extraction through layered tensor decomposition for hyperspectral anomaly detection
- General inertial smoothing Bregman proximal gradient algorithms for group capped-_1 regularized minimization
- Optimal group thresholding algorithms for group sparse optimization with convergence guarantee
- Recovery bounds for cardinality regularized optimization problem
This page was built for publication: Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5860273)
