Pages that link to "Item:Q2359752"
From MaRDI portal
The following pages link to Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration (Q2359752):
Displaying 29 items.
- On the choice of regularization matrix for an \(\ell_2\)-\(\ell_q\) minimization method for image restoration (Q1995949) (← links)
- An \(\ell^2\)-\(\ell^q\) regularization method for large discrete ill-posed problems (Q1999875) (← links)
- A non-convex regularization approach for compressive sensing (Q2000486) (← links)
- Fast alternating direction multipliers method by generalized Krylov subspaces (Q2063215) (← links)
- A comparison of parameter choice rules for \(\ell^p\)-\(\ell^q\) minimization (Q2084586) (← links)
- Krylov subspace split Bregman methods (Q2106230) (← links)
- Large-scale regression with non-convex loss and penalty (Q2192647) (← links)
- Two-stage image segmentation based on nonconvex \(\ell_2-\ell_p\) approximation and thresholding (Q2242811) (← links)
- An \(\ell^p\)-\(\ell^q\) minimization method with cross-validation for the restoration of impulse noise contaminated images (Q2309287) (← links)
- Fractional Tikhonov regularization with a nonlinear penalty term (Q2360714) (← links)
- Convex non-convex image segmentation (Q2413469) (← links)
- Generalized cross validation for \(\ell^p\)-\(\ell^q\) minimization (Q2665937) (← links)
- Graph Laplacian for image deblurring (Q2672169) (← links)
- \(L_2\)-\(L_q\) reconstruction model for computational spectrometer (Q2677865) (← links)
- A majorization-minimization Golub-Kahan bidiagonalization method for \(\ell_2-\ell_q\) mimimization with applications in image restorization (Q2697382) (← links)
- A note on the minimization of a Tikhonov functional with ℓ<sup>1</sup>-penalty (Q3298393) (← links)
- A variational non-linear constrained model for the inversion of FDEM data* (Q5019919) (← links)
- A Krylov subspace type method for Electrical Impedance Tomography (Q5034832) (← links)
- Modulus-based iterative methods for constrained <b> <i>ℓ</i> </b> <sub> <i>p</i> </sub>–<b> <i>ℓ</i> </b> <sub> <i>q</i> </sub> minimization (Q5117383) (← links)
- Limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces (Q6038831) (← links)
- An efficient implementation of the Gauss-Newton method via generalized Krylov subspaces (Q6057154) (← links)
- A modulus iteration method for non-negatively constrained TV image restoration (Q6072892) (← links)
- A computational framework for edge-preserving regularization in dynamic inverse problems (Q6076066) (← links)
- A data-driven Kaczmarz iterative regularization method with non-smooth constraints for ill-posed problems (Q6086874) (← links)
- A variable projection method for large-scale inverse problems with \(\ell^1\) regularization (Q6086881) (← links)
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum (Q6101532) (← links)
- Variable projection methods for separable nonlinear inverse problems with general-form Tikhonov regularization (Q6110531) (← links)
- Symmetrization techniques in image deblurring (Q6146170) (← links)
- A Flexible Space-Variant Anisotropic Regularization for Image Restoration with Automated Parameter Selection (Q6176000) (← links)
