Proximal method of solving split system of minimization problem
type: Item
instance of: scholarly article
title: Proximal method of solving split system of minimization problem
zbMATH Open document ID: 1475.90057
author: Anteneh Getachew Gebrie
author: Rabian Wangkeeree
published in: Journal of Applied Mathematics and Computing
publication date: 2021-11-29T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 47H09
Mathematics Subject Classification ID: 47J25
zbMATH DE Number: 7435090
zbMATH Keywords: minimization problems
zbMATH Keywords: split feasibility problem
zbMATH Keywords: Moreau-Yosida approximate
zbMATH Keywords: Hilbert space
MaRDI profile type: Publication
full work available at URL: s12190-019-01310-w
OpenAlex ID: W2994999668
cites work: Iterative methods for solving proximal split minimization problems
cites work: Convex analysis and monotone operator theory in Hilbert spaces
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: The Split Common Null Point Problem
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: Algorithms for the split variational inequality problem
cites work: Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
cites work: Q4681445
cites work: The strong convergence of a three-step algorithm for the split feasibility problem
cites work: Hybrid projected subgradient-proximal algorithms for solving split equilibrium problems and split common fixed point problems of nonexpansive mappings in Hilbert spaces
cites work: Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
cites work: Iterative approximation of a common solution of a split equilibrium problem, a variational inequality problem and a fixed point problem
cites work: Hybrid iterative scheme by a relaxed extragradient method for solutions of equilibrium problems and a general system of variational inequalities with application to optimization
cites work: A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping
cites work: Strong convergence for generalized multiple-set split feasibility problem
cites work: Q4362986
cites work: Solving the split feasibility problem without prior knowledge of matrix norms
cites work: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
cites work: Q5633161
cites work: Q5618030
cites work: Q5445188
cites work: Solving proximal split feasibility problems without prior knowledge of operator norms
cites work: A note on the CQ algorithm for the split feasibility problem
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: On the Maximality of Sums of Nonlinear Monotone Operators
cites work: Iterative approximation of solutions for proximal split feasibility problems
cites work: Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems
cites work: Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
cites work: Nonlinear iteration method for proximal split feasibility problems
cites work: Strong convergence result for proximal split feasibility problem in Hilbert spaces
cites work: Convergence analysis for proximal split feasibility problems and fixed point problems
cites work: A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
cites work: Another control condition in an iterative method for nonexpansive mappings
cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
DOI: 10.1007/S12190-019-01310-W
description: scientific article; zbMATH DE number 7435090