New proximal type algorithms for convex minimization and its application to image deblurring
- 30 September 2022
- journal article
- research article
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 41 (7) , 1-18
Abstract
No abstract availableKeywords
Funding Information
- National Research Council of Thailand (N41A640094)
- Thailand Science Research and Innovation (IRN62W0007)
This publication has 25 references indexed in Scilit:
- An extragradient method for solving split feasibility and fixed point problemsComputers & Mathematics with Applications, 2012
- Solving the split feasibility problem without prior knowledge of matrix normsInverse Problems, 2012
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problemInverse Problems, 2010
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spacesInverse Problems, 2010
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- The relaxed CQ algorithm solving the split feasibility problemInverse Problems, 2004
- Image quality assessment: from error visibility to structural similarityIEEE Transactions on Image Processing, 2004
- A unified treatment of some iterative algorithms in signal processing and image reconstructionInverse Problems, 2003
- Convergence of a splitting inertial proximal method for monotone operatorsJournal of Computational and Applied Mathematics, 2003
- Iterative oblique projection onto convex sets and the split feasibility problemInverse Problems, 2002