Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
From MaRDI portal
Publication:2067797
DOI10.1186/s13660-019-2030-xzbMath1499.90156OpenAlexW2947763803WikidataQ128130851 ScholiaQ128130851MaRDI QIDQ2067797
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2030-x
Convex programming (90C25) Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15)
Related Items
A relaxed projection method using a new linesearch for the split feasibility problem, Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces, Unnamed Item, Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces, Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of generalized evolution variational inequalities in Banach spaces
- Iterative methods for solving monotone equilibrium problems via dual gap functions
- Solving proximal split feasibility problems without prior knowledge of operator norms
- An algorithm for a class of split feasibility problems: application to a model in electricity production
- An inexact subgradient algorithm for equilibrium problems
- Averaged mappings and the gradient-projection algorithm
- Algorithms for the split variational inequality problem
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- Combined relaxation methods for variational inequalities
- Inertial projection and contraction algorithms for variational inequalities
- Selective projection methods for solving a class of variational inequalities
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- Strong convergence of a self-adaptive method for the split feasibility problem
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- Solving the split equality problem without prior knowledge of operator norms
- The extragradient algorithm with inertial effects for solving the variational inequality
- The multiple-sets split feasibility problem and its applications for inverse problems
- Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms
- Convergence of an adaptive penalty scheme for finding constrained equilibria
- Variational Analysis
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Single projection method for pseudo-monotone variational inequality in Hilbert spaces
- Iterative algorithms for the split variational inequality and fixed point problems under nonlinear transformations
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- The Method of Pairwise Variations with Tolerances for Linearly Constrained Optimization Problems
- A Geometrical Look at Iterative Methods for Operators with Fixed Points
- A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces
- Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
