Fast L1-L2 minimization via a proximal operator
From MaRDI portal
Publication:1742664
DOI10.1007/s10915-017-0463-2zbMath1390.90447arXiv1609.09530OpenAlexW2963960715MaRDI QIDQ1742664
Publication date: 12 April 2018
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.09530
alternating direction method of multiplierscompressive sensingproximal operatorforward-backward splittingdifference-of-convex
Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10)
Related Items (40)
An efficient semismooth Newton method for adaptive sparse signal recovery problems ⋮ Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence ⋮ An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems ⋮ Nonconvex regularization for blurred images with Cauchy noise ⋮ A General Framework of Rotational Sparse Approximation in Uncertainty Quantification ⋮ Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee ⋮ Newton method for \(\ell_0\)-regularized optimization ⋮ Stable Image Reconstruction Using Transformed Total Variation Minimization ⋮ A nonconvex nonsmooth image prior based on the hyperbolic tangent function ⋮ Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ Sorted \(L_1/L_2\) minimization for sparse signal recovery ⋮ A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems ⋮ Structured model selection via ℓ1−ℓ2 optimization ⋮ \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery ⋮ A three-operator splitting algorithm with deviations for generalized DC programming ⋮ \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization ⋮ An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost ⋮ Low rank matrix minimization with a truncated difference of nuclear norm and Frobenius norm regularization ⋮ Conic formulation of QPCCs applied to truly sparse QPs ⋮ Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization ⋮ A projected gradient method for αℓ 1 − βℓ 2 sparsity regularization ** ⋮ Iteratively Reweighted Group Lasso Based on Log-Composite Regularization ⋮ Fast algorithms for robust principal component analysis with an upper bound on the rank ⋮ Bilinear constraint based ADMM for mixed Poisson-Gaussian noise removal ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing ⋮ Image restoration based on fractional-order model with decomposition: texture and cartoon ⋮ A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications ⋮ Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers ⋮ Perturbation analysis of \(L_{1-2}\) method for robust sparse recovery ⋮ An image sharpening operator combined with framelet for image deblurring ⋮ ℓ 1 − αℓ 2 minimization methods for signal and image reconstruction with impulsive noise removal ⋮ New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods ⋮ Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization ⋮ A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation ⋮ The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization ⋮ The proximity operator of the log-sum penalty ⋮ New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model ⋮ A unified Douglas-Rachford algorithm for generalized DC programming
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- Point source super-resolution via non-convex \(L_1\) based methods
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
- Compressed sensing recovery via nonconvex shrinkage penalties
- Proximity Maps for Convex Sets
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Sparse representations in unions of bases
- Linear Inversion of Band-Limited Reflection Seismograms
- Variational Analysis
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Constructing Test Instances for Basis Pursuit Denoising
- Sparse Approximate Solutions to Linear Systems
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: Fast L1-L2 minimization via a proximal operator
