On the minimization of a Tikhonov functional with a non-convex sparsity constraint
zbMATH Open1287.65044MaRDI QIDQ2447397FDOQ2447397
Authors: Ronny Ramlau, Clemens A. Zarzer 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- A global minimization algorithm for Tikhonov functionals with sparsity constraints
- On Tikhonov regularization with non-convex sparsity constraints
- A semismooth Newton method for Tikhonov functionals with sparsity constraints
- A note on the minimization of a Tikhonov functional with \(\ell^1\)-penalty
- Multilevel preconditioning for sparse optimization of functionals with nonconvex fidelity terms
regularizationinverse problemsparsityalgorithmparameter identificationTikhonov functionaldeconvolution problemgradient based algorithmsurrogate functional\(\ell \)-sparsity constraints
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 solution to inverse problems in abstract spaces (65J22) Numerical methods for inverse problems for integral equations (65R32)
Cited In (23)
- A projected gradient method for nonlinear inverse problems with \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization
- A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs
- A note on the minimization of a Tikhonov functional with \(\ell^1\)-penalty
- On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1]\)
- A generalized conditional gradient method for nonlinear operator equations with sparsity constraints
- Non-convex sparse regularisation
- Large-scale regression with non-convex loss and penalty
- A semismooth Newton method for Tikhonov functionals with sparsity constraints
- Algorithmic versatility of SPF-regularization methods
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
- \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization for nonlinear ill-posed problems
- \(\alpha\ell_1-\beta\ell_2\) regularization for sparse recovery
- A projected gradient method for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- A global minimization algorithm for Tikhonov functionals with \(p\)-convex \((p \geqslant 2)\) penalty terms in Banach spaces
- A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors
- Variable selection in saturated and supersaturated designs via lp-lq minimization
- Orbital minimization method with \(\ell^{1}\) regularization
- A global minimization algorithm for Tikhonov functionals with sparsity constraints
- Sparse optimization on measures with over-parameterized gradient descent
- Gradient descent for Tikhonov functionals with sparsity constraints: theory and numerical comparison of step size rules
- Approximation of penalty terms in Tikhonov functional-theory and applications in inverse problems
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
Uses Software
This page was built for publication: On the minimization of a Tikhonov functional with a non-convex sparsity constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447397)
