Regularization with non-convex separable constraints
From MaRDI portal
Recommendations
- On Tikhonov regularization with non-convex sparsity constraints
- Well-posedness and convergence rates for sparse regularization with sublinear \(l^q\) penalty term
- Non-convex sparse regularisation
- Convergence rates for regularization with sparsity constraints
- Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
Cited in
(34)- Regularization and convergence for ill-posed backward evolution equations in Banach spaces
- A convex variational model for learning convolutional image atoms from incomplete data
- New regularization method and iteratively reweighted algorithm for sparse vector recovery
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- Convergence rates for oversmoothing Banach space regularization
- Well-posedness and convergence rates for sparse regularization with sublinear \(l^q\) penalty term
- The Ivanov regularized Gauss-Newton method in Banach space with an a posteriori choice of the regularization radius
- Tikhonov regularization with \({\ell^{0}}\)-term complementing a convex penalty: \({\ell^{1}}\)-convergence under sparsity constraints
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Morozov's discrepancy principle for _1-_2 sparsity regularization
- Theory and examples of variational regularization with non-metric fitting functionals
- Regularization properties of the sequential discrepancy principle for Tikhonov regularization in Banach spaces
- Solution smoothness of ill-posed equations in Hilbert spaces: four concepts and their cross connections
- Flexible sparse regularization
- Elastic-net regularization versus ℓ 1 -regularization for linear inverse problems with quasi-sparse solutions
- Flexible constraints for regularization in learning from data
- A New Approach to Source Conditions in Regularization with General Residual Term
- On Tikhonov regularization with non-convex sparsity constraints
- The residual method for regularizing ill-posed problems
- On ℓ 1 -Regularization Under Continuity of the Forward Operator in Weaker Topologies
- On convergence and convergence rates for Ivanov and Morozov regularization and application to some parameter identification problems in elliptic PDEs
- A range condition for polyconvex variational regularization
- Convergence rates in \(\ell^{1}\)-regularization when the basis is not smooth enough
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- Modulus-based iterative methods for constrained \(\ell_p\)-\(\ell_q\) minimization
- \(\alpha\ell_1-\beta\ell_2\) regularization for sparse recovery
- Convergence rates for regularization functionals with polyconvex integrands
- Sparsity-assisted signal smoothing
- Variance-based regularization with convex objectives
- Convergence of non-linear diagonal frame filtering for regularizing inverse problems
- Nonstationary asymptotical regularization method with convex constraints for linear ill-posed problems
- _1 - _2 sparsity regularization for nonlinear ill-posed problems
- Injectivity and \(\text{weak}^\star\)-to-weak continuity suffice for convergence rates in \(\ell^{1}\)-regularization
- Non-convex sparse regularisation
This page was built for publication: Regularization with non-convex separable constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396308)
