New proximal type algorithms for convex minimization and its application to image deblurring
type: Item
instance of: scholarly article
title: New proximal type algorithms for convex minimization and its application to image deblurring
author: Suparat Kesornprom
author: Prasit Cholamjiak
author: Choonkil Park
published in: Computational and Applied Mathematics
publication date: 2022-10-14T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7601626
zbMATH Keywords: convex minimization problem
zbMATH Keywords: forward-backward method
zbMATH Keywords: linesearch rule
zbMATH Keywords: inertial method
zbMATH Keywords: weak convergence
MaRDI profile type: Publication
full work available at URL: s40314-022-02042-7
OpenAlex ID: W4298125231
cites work: Split Feasibility and Fixed Point Problems
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: On the convergence of the forward–backward splitting method with linesearches
cites work: Set-valued mappings and enlargement of monotone operators.
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: An extragradient method for solving split feasibility and fixed point problems
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces
cites work: The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
cites work: Entropy-Like Proximal Methods in Convex Programming
cites work: Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier
cites work: Solving the split feasibility problem without prior knowledge of matrix norms
cites work: Convergence of a splitting inertial proximal method for monotone operators
cites work: Q4547144
cites work: Iterative method with inertial for variational inequalities in Hilbert spaces
cites work: An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
cites work: Q4864293
cites work: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
cites work: The relaxed CQ algorithm solving the split feasibility problem
DOI: 10.1007/S40314-022-02042-7
description: scientific article; zbMATH DE number 7601626