Iiduka type algorithms for minimization problems in finite dimensional Hilbert spaces with applications in the image deblurring problem
zbMATH Open1372.90069MaRDI QIDQ2836035FDOQ2836035
Authors: Chih-Sheng Chuang 
Publication date: 7 December 2016
Published in: Journal of Nonlinear and Convex Analysis (Search for Journal in Brave)
Full work available at URL: http://www.yokohamapublishers.jp/online2/opjnca/vol17/p1679.html
Recommendations
- New proximal type algorithms for convex minimization and its application to image deblurring
- Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem
- Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring
- Algorithms for approximating minimization problems in Hilbert spaces
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cited In (3)
- On a class of ill-posed minimization problems in image processing
- Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem
- New proximal type algorithms for convex minimization and its application to image deblurring
This page was built for publication: Iiduka type algorithms for minimization problems in finite dimensional Hilbert spaces with applications in the image deblurring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836035)
