Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

New proximal type algorithms for convex minimization and its application to image deblurring

Authors
Kesornprom, SuparatCholamjiak, PrasitPark, Choonkil
Issue Date
Oct-2022
Publisher
SPRINGER HEIDELBERG
Keywords
Convex minimization problem; Forward-backward method; Linesearch rule; Inertial method; Weak convergence
Citation
COMPUTATIONAL & APPLIED MATHEMATICS, v.41, no.7
Indexed
SCIE
SCOPUS
Journal Title
COMPUTATIONAL & APPLIED MATHEMATICS
Volume
41
Number
7
URI
https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/173015
DOI
10.1007/s40314-022-02042-7
ISSN
0101-8205
2238-3603
Abstract
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.
Files in This Item
Go to Link
Appears in
Collections
서울 자연과학대학 > 서울 수학과 > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetrics

Total Views & Downloads

BROWSE