A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
type: Item
instance of: scholarly article
title: A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
zbMATH Open document ID: 1491.47060
author: Müzeyyen Ertürk
author: Asiye Kızmaz
published in: Vietnam Journal of Mathematics
publication date: 2021-12-03T00:00:00Z
Mathematics Subject Classification ID: 47J25
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 7438379
zbMATH Keywords: gradient projection algorithm
zbMATH Keywords: convex optimization problem
zbMATH Keywords: fixed point
zbMATH Keywords: split feasibility problem
zbMATH Keywords: Hilbert space
zbMATH Keywords: weak convergence
MaRDI profile type: Publication
full work available at URL: s10013-020-00463-7
OpenAlex ID: W3118927758
cites work: Fixed Point Theory for Lipschitzian-type Mappings with Applications
cites work: Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
cites work: Q5254293
cites work: Q5665783
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: Hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: The multiple-sets split feasibility problem and its applications for inverse problems
cites work: Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
cites work: Solving monotone inclusions via compositions of nonexpansive averaged operators
cites work: Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
cites work: Q3998720
cites work: Convex programming in Hilbert space
cites work: Q3502554
cites work: Common fixed points Noor iteration for a finite family of asymptotically quasi-nonexpansive mappings in Banach spaces
cites work: Q5576518
cites work: Solving the split feasibility problem without prior knowledge of matrix norms
cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
cites work: Strong convergence of the CQ method for fixed point iteration processes
cites work: New approximation schemes for general variational inequalities
cites work: New extragradient-type methods for general variational inequalities.
cites work: Q3620604
cites work: Weak convergence of the sequence of successive approximations for nonexpansive mappings
cites work: Stability and strong convergence results for random Jungck-Kirk-Noor iterative scheme
cites work: Weak and strong convergence criteria of Noor iterations for asymptotically nonexpansive mappings
cites work: Iterative methods for generalized split feasibility problems in Hilbert spaces
cites work: General iterative methods for equilibrium and constrained convex minimization problem
cites work: Convergence of the gradient projection method for generalized convex minimization
cites work: Linear convergence of CQ algorithms and applications in gene regulatory network inference
cites work: A family of projection gradient methods for solving the multiple-sets split feasibility problem
cites work: Averaged mappings and the gradient-projection algorithm
cites work: Strong convergence of a self-adaptive method for the split feasibility problem
cites work: A simpler explicit iterative algorithm for a class of variational inequalities in Hilbert spaces
DOI: 10.1007/S10013-020-00463-7
description: scientific article; zbMATH DE number 7438379