Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
From MaRDI portal
Publication:5860273
DOI10.1137/19M1304799zbMath1474.90507OpenAlexW3118396380MaRDI QIDQ5860273
No author found.
Publication date: 19 November 2021
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1304799
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, 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, 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, A smoothing proximal gradient algorithm for matrix rank minimization problem
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Best subset selection via a modern optimization lens
- Proximal methods for the latent group lasso penalty
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- The benefit of group sparsity
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere
- On convex envelopes and regularization of non-convex functionals without moving global minima
- Optimization problems involving group sparsity terms
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Generalized Alternating Projection for Weighted-$\ell_{2,1}$ Minimization with Applications to Model-Based Compressive Sensing
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Probing the Pareto Frontier for Basis Pursuit Solutions
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- A group bridge approach for variable selection
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Reconstruction by Separable Approximation
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
- Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
- Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere
- Sparse optimization for nonconvex group penalized estimation
- Nonconvex Optimization for 3-Dimensional Point Source Localization Using a Rotating Point Spread Function
- Subspace Methods for Joint Sparse Recovery
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization
- Group sparse optimization via $\ell_{p,q}$ regularization
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- Model Selection and Estimation in Regression with Grouped Variables
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
