On the minimization of a Tikhonov functional with a non-convex sparsity constraint

zbMath1287.65044MaRDI QIDQ2447397

Clemens A. Zarzer, Ronny Ramlau

Publication date: 25 April 2014

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/ETNA/vol.39.2012/pp476-507.dir/pp476-507.html

zbMATH Keywords

algorithminverse problemregularizationparameter identificationTikhonov functionalsparsitydeconvolution problemgradient based algorithmsurrogate functional\(\ell \)-sparsity constraints

Mathematics Subject Classification ID

Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical methods for inverse problems for integral equations (65R32) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items

Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration, Conjugate gradient acceleration of iteratively re-weighted least squares methods, Non-convex sparse regularisation, Nonconvex flexible sparsity regularization: theory and monotone numerical schemes, Variable selection in saturated and supersaturated designs via lp-lq minimization, Large-scale regression with non-convex loss and penalty, A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors, A projected gradient method for αℓ ₁ − βℓ ₂ sparsity regularization ^**, On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1\)], $ \newcommand{\e}{{\rm e}} {\alpha\ell_{1}-\beta\ell_{2}}$ regularization for sparse recovery, A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs

Uses Software

• TwIST