상세 보기
초록
In this work, we are interested in solving a convex minimization problem in real Hilbert spaces. We propose a new modified proximal algorithm using the inertial extrapolation and the linesearch technique. Its weak convergence theorems are established under mild conditions. Numerical experiments are presented to illustrate the performance of the proposed algorithm in image deblurring.
키워드
Convex minimization problem; Forward-backward method; Linesearch rule; Inertial method; Weak convergence; SPLIT FEASIBILITY; CONVERGENCE; SHRINKAGE
- 제목
- New proximal type algorithms for convex minimization and its application to image deblurring
- 저자
- Kesornprom, Suparat; Cholamjiak, Prasit; Park, Choonkil
- 발행일
- 2022-10
- 유형
- Article
- 권
- 41
- 호
- 7