Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
From MaRDI portal
Publication:2929994
DOI10.1137/110855867zbMath1306.65211arXiv1412.4452OpenAlexW2964233346MaRDI QIDQ2929994
No author found.
Publication date: 17 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.4452
No records found.
No records found.
Related Items (9)
Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations ⋮ Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound ⋮ A smoothing method for sparse optimization over convex sets ⋮ A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery ⋮ Equivalent Lipschitz surrogates for zero-norm and rank optimization problems ⋮ A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem ⋮ An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization ⋮ Weighted thresholding homotopy method for sparsity constrained optimization ⋮ 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
This page was built for publication: Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
