Regularization with non-convex separable constraints

From MaRDI portal
Publication:3396308

DOI10.1088/0266-5611/25/8/085011zbMath1180.65068OpenAlexW2026132654WikidataQ57562029 ScholiaQ57562029MaRDI QIDQ3396308

Dirk A. Lorenz, Kristian Bredies

Publication date: 17 September 2009

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d437debd43e43c1edf366d1911a0f5a6ff9b88a1




Related Items (27)

Solution smoothness of ill-posed equations in Hilbert spaces: four concepts and their cross connectionsNon-convex sparse regularisationOn ℓ 1 -Regularization Under Continuity of the Forward Operator in Weaker TopologiesRegularization and convergence for ill-posed backward evolution equations in Banach spacesNonconvex flexible sparsity regularization: theory and monotone numerical schemesOn convergence and convergence rates for Ivanov and Morozov regularization and application to some parameter identification problems in elliptic PDEsConvergence rates for regularization functionals with polyconvex integrandsSparsity-Assisted Signal SmoothingThe residual method for regularizing ill-posed problemsModulus-based iterative methods for constrained p q minimizationFlexible sparse regularizationElastic-net regularization versus 1 -regularization for linear inverse problems with quasi-sparse solutionsMorozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularizationA convex variational model for learning convolutional image atoms from incomplete dataInjectivity and \(\text{weak}^\star\)-to-weak continuity suffice for convergence rates in \(\ell^{1}\)-regularizationA New Approach to Source Conditions in Regularization with General Residual TermA Range Condition for Polyconvex Variational RegularizationNew regularization method and iteratively reweighted algorithm for sparse vector recovery$ \newcommand{\e}{{\rm e}} {\alpha\ell_{1}-\beta\ell_{2}}$ regularization for sparse recoveryConvergence rates in1-regularization when the basis is not smooth enoughThe Ivanov regularized Gauss-Newton method in Banach space with an a posteriori choice of the regularization radiusTikhonov regularization with \({\ell^{0}}\)-term complementing a convex penalty: \({\ell^{1}}\)-convergence under sparsity constraintsSmoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problemConvergence rates for oversmoothing Banach space regularizationMinimization of non-smooth, non-convex functionals by iterative thresholdingTheory and examples of variational regularization with non-metric fitting functionalsRegularization properties of the sequential discrepancy principle for Tikhonov regularization in Banach spaces




This page was built for publication: Regularization with non-convex separable constraints