Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
type: Item
instance of: scholarly article
title: Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
zbMATH Open document ID: 1499.90156
author: Yanyan Li
published in: Journal of Inequalities and Applications
publication date: 2022-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49J40
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 47H09
Mathematics Subject Classification ID: 47J25
Mathematics Subject Classification ID: 65J15
zbMATH DE Number: 7459105
zbMATH Keywords: split feasibility problem
zbMATH Keywords: equilibria
zbMATH Keywords: constrained convex optimization
zbMATH Keywords: practical model
MaRDI profile type: Publication
full work available at URL: s13660-019-2030-x
OpenAlex ID: W2947763803
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Q4366516
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: The multiple-sets split feasibility problem and its applications for inverse problems
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: Algorithms for the split variational inequality problem
cites work: Solving monotone inclusions via compositions of nonexpansive averaged operators
cites work: A Geometrical Look at Iterative Methods for Operators with Fixed Points
cites work: A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces
cites work: Inertial projection and contraction algorithms for variational inequalities
cites work: Solving the split equality problem without prior knowledge of operator norms
cites work: The extragradient algorithm with inertial effects for solving the variational inequality
cites work: ``Optimal'' choice of the step length of the projection and contraction methods for solving the split feasibility problem
cites work: Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
cites work: Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
cites work: Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces
cites work: Selective projection methods for solving a class of variational inequalities
cites work: Q5142522
cites work: Combined relaxation methods for variational inequalities
cites work: The Method of Pairwise Variations with Tolerances for Linearly Constrained Optimization Problems
cites work: Solving proximal split feasibility problems without prior knowledge of operator norms
cites work: Convergence of an adaptive penalty scheme for finding constrained equilibria
cites work: Iterative methods for solving monotone equilibrium problems via dual gap functions
cites work: Variational Analysis
cites work: An inexact subgradient algorithm for equilibrium problems
cites work: Single projection method for pseudo-monotone variational inequality in Hilbert spaces
cites work: A class of generalized evolution variational inequalities in Banach spaces
cites work: Averaged mappings and the gradient-projection algorithm
cites work: Q4604753
cites work: Iterative algorithms for the split variational inequality and fixed point problems under nonlinear transformations
cites work: Q5215312
cites work: Strong convergence of a self-adaptive method for the split feasibility problem
cites work: An algorithm for a class of split feasibility problems: application to a model in electricity production
cites work: Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms
cites work: Iterative algorithms for solving the split feasibility problem in Hilbert spaces
Wikidata QID: Q128130851
DOI: 10.1186/S13660-019-2030-X
description: scientific article; zbMATH DE number 7459105