Projected gradient iteration for nonlinear operator equation
\(\ell_p\)-norm constraintFréchet differentiabilityill-posed nonlinear operator equationprojected gradient iterationshrinkage operator
Other nonlinear integral equations (45G10) Nonlinear ill-posed problems (47J06) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical methods for integral equations (65R20)
The article deals with the following iterative method \[ x^{(n+1)} = \text{arg} \, \min_{w \in B_{R,p}} \;F_{\alpha^{(n)}}(w,x^{(n)}), \] where \(F_\alpha(w,x) = \Delta(w) - \|F(w) - F(x)\|_H^2 + \frac1\alpha \, \|w - x\|_2^2\), \(\Delta(x) = \|AS^*(x) - y\|_H^2\), for solving a nonlinear equation \(A(f) = y\), where \(A\) is a possibly ill-posed operator from \(X\) to \(H\). The operator \(F\) is defined as \(F = AS^*\), where \(S^*\) is some special operator from \(\ell_2({\mathbb Z}) \to X\). The main theorem describes conditions under which, for a weak accumulation point of \((x^{(n)})\), there exists a subsequence \((x^{(n_j)})\) converging to this accumulation point. In the end of the article the equation \[ \int_0^s x(s - t)x(t) \, dt = y(s) \] is considered. It should be remarked that the article is really unreadable and written in an awful manner; the authors begin from the equation \(A(f) = y\), then they deal with operator \(F = AS^*\), then \(F\) is simply a nonlinear operator supposedly between Hilbert space \(X\) and \(Y\), but this \(Y\) after some time turns into \(H\) and so on.
- Gradient iteration with \(\ell _{p}\)-norm constraints
- Accelerated projected steepest descent method for nonlinear inverse problems with sparsity constraints
- An efficient gradient-free projection algorithm for constrained nonlinear equations and image restoration
- A conjugate gradient like method for p-norm minimization in functional spaces
- On the convergence of gradient-type methods for nonlinear equations
- A generalized conditional gradient method and its connection to an iterative shrinkage method
- A Tikhonov-based projection iteration for nonlinear ill-posed problems with sparsity con\-straints
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- Accelerated projected steepest descent method for nonlinear inverse problems with sparsity constraints
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Linear convergence of iterative soft-thresholding
- On autoconvolution and regularization
- Regularization properties of Tikhonov regularization with sparsity constraints
- Stable signal recovery from incomplete and inaccurate measurements
- Tikhonov replacement functionals for iteratively solving nonlinear operator equations
This page was built for publication: Projected gradient iteration for nonlinear operator equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633958)
