Pages that link to "Item:Q5117383"
From MaRDI portal
The following pages link to 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):
Displaying 14 items.
- On the choice of regularization matrix for an \(\ell_2\)-\(\ell_q\) minimization method for image restoration (Q1995949) (← 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)
- Large-scale regression with non-convex loss and penalty (Q2192647) (← links)
- Graph Laplacian for image deblurring (Q2672169) (← 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)
- Foreword to special issue of Inverse Problems on modern challenges in imaging (Q5875955) (← links)
- Uniformly convex neural networks and non-stationary iterated network Tikhonov (iNETT) method (Q5886392) (← links)
- Limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces (Q6038831) (← 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)
- Variable projection methods for separable nonlinear inverse problems with general-form Tikhonov regularization (Q6110531) (← links)
- Software for limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces (Q6572625) (← links)
