Minimization of non-smooth, non-convex functionals by iterative thresholding
From MaRDI portal
Publication:2346390
DOI10.1007/s10957-014-0614-7zbMath1321.49048OpenAlexW1969387119WikidataQ57561965 ScholiaQ57561965MaRDI QIDQ2346390
Stefan Reiterer, Kristian Bredies, Dirk A. Lorenz
Publication date: 1 June 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0614-7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (33)
Joint estimation and variable selection for mean and dispersion in proper dispersion models ⋮ A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis ⋮ Conjugate gradient acceleration of iteratively re-weighted least squares methods ⋮ Global Convergence of Splitting Methods for Nonconvex Composite Optimization ⋮ Error bounds and stability in the \(\ell_0\) regularized for CT reconstruction from small projections ⋮ Bias versus non-convexity in compressed sensing ⋮ Shape derivative for penalty-constrained nonsmooth-nonconvex optimization: cohesive crack problem ⋮ Nonconvex flexible sparsity regularization: theory and monotone numerical schemes ⋮ Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery ⋮ Existence and convergence analysis of \(\ell_{0}\) and \(\ell_{2}\) regularizations for limited-angle CT reconstruction ⋮ Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery ⋮ Accelerated matrix completion algorithm using continuation strategy and randomized SVD ⋮ Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods ⋮ A characterization of proximity operators ⋮ Flexible sparse regularization ⋮ An unbiased approach to compressed sensing ⋮ A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem ⋮ On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1\)] ⋮ A proximal gradient method for control problems with non-smooth and non-convex control cost ⋮ Fast L1-L2 minimization via a proximal operator ⋮ GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression ⋮ A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization ⋮ An introduction to continuous optimization for imaging ⋮ Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems ⋮ On a monotone scheme for nonconvex nonsmooth optimization with applications to fracture mechanics ⋮ A unified primal dual active set algorithm for nonconvex sparse recovery ⋮ Whiteness constraints in a unified variational framework for image restoration ⋮ $ \newcommand{\e}{{\rm e}} {\alpha\ell_{1}-\beta\ell_{2}}$ regularization for sparse recovery ⋮ Flexible, boundary adapted, nonparametric methods for the estimation of univariate piecewise-smooth functions ⋮ A variational model for deformable registration of uni-modal medical images with intensity biases ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ Computational approaches to non-convex, sparsity-inducing multi-penalty regularization ⋮ One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Linear convergence of iterative soft-thresholding
- Local linear convergence for alternating and averaged nonconvex projections
- Non-convex sparse regularisation
- Conjugate gradient algorithms in nonconvex optimization
- Computing proximal points of nonconvex functions
- Proximal mappings
- Proximal point methods and nonconvex optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Regularization with non-convex separable constraints
- Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- Variational Analysis
- Analysis of multiresolution image denoising schemes using generalized Gaussian and complexity priors
- A variational approach to sparsity optimization based on Lagrange multiplier theory
- Signal Recovery by Proximal Forward-Backward Splitting
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
This page was built for publication: Minimization of non-smooth, non-convex functionals by iterative thresholding
