Convex minimization problems based on an accelerated fixed point algorithm with applications to image restoration problems
From MaRDI portal
(Redirected from Publication:5058176)
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A parallel inertial S-iteration forward-backward algorithm for regression and classification problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Algorithms for the regularization of ill-conditioned least squares problems
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Approximation of common fixed points of a countable family of nonexpansive mappings in a Banach space
- Computational Methods for Inverse Problems
- Deblurring Images
- Fixed Points by a New Iteration Method
- Fixed points of nonexpanding maps
- Fixed points of quasinonexpansive mappings
- Fixed-point algorithms for inverse problems in science and engineering. Based on the presentations at the interdisciplinary workshop, BIRS, Banff, Canada, November 1--6, 2009.
- scientific article; zbMATH DE number 5154870 (Why is no real title available?)
- scientific article; zbMATH DE number 5154873 (Why is no real title available?)
- scientific article; zbMATH DE number 1214041 (Why is no real title available?)
- scientific article; zbMATH DE number 1766751 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- Inertial forward-backward splitting method in Banach spaces with application to compressed sensing
- Mean Value Methods in Iteration
- On convergence and complexity of the modified forward‐backward method involving new linesearches for convex minimization
- On strong convergence by the hybrid method for families of mappings in Hilbert spaces
- Quasi-Fejérian analysis of some optimization algorithms
- Signal Recovery by Proximal Forward-Backward Splitting
- Some methods of speeding up the convergence of iteration methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Strong convergence of inertial forward–backward methods for solving monotone inclusions
- Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces
- Strong convergence theorems by the hybrid method for families of nonexpansive mappings in Hilbert spaces
- Weak and strong convergence of splitting algorithms in Banach spaces
Cited in
(5)- On a class of ill-posed minimization problems in image processing
- Acceleration methods for image restoration problem with different boundary conditions
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- Comparative studies of the globally convergent convexification algorithm with application to imaging of antipersonnel land mines
- Double inertial subgradient extragradient algorithm for solving equilibrium problems and common fixed point problems with application to image restoration
This page was built for publication: Convex minimization problems based on an accelerated fixed point algorithm with applications to image restoration problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058176)
