Simultaneous and semi-alternating projection algorithms for solving split equality problems
From MaRDI portal
Publication:1688525
DOI10.1186/S13660-017-1595-5zbMath1386.90169OpenAlexW2781939098WikidataQ47556786 ScholiaQ47556786MaRDI QIDQ1688525
Publication date: 8 January 2018
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1595-5
maximal monotone operatorsplit equality problemsemi-alternating projection algorithmsimultaneous projection algorithm
Minimax problems in mathematical programming (90C47) Existence of solutions for minimax problems (49J35)
Related Items (3)
Outer perturbations of a projection method and two approximation methods for the split equality problem ⋮ A unified algorithm for solving variational inequality and fixed point problems with application to the split equality problem ⋮ Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Hybrid simultaneous algorithms for the split equality problem with applications
- Iterative methods for fixed point problems in Hilbert spaces
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
- Algorithms for the split variational inequality problem
- A multiprojection algorithm using Bregman projections in a product space
- A relaxed alternating CQ-algorithm for convex feasibility problems
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Solving the split equality problem without prior knowledge of operator norms
- Self-adaptive projection algorithms for solving the split equality problems
- Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms
- Monotone Operators and the Proximal Point Algorithm
- Solve the split equality problem by a projection algorithm with inertial effects
- The Split Common Null Point Problem
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space
- Some methods of speeding up the convergence of iteration methods
- Convex analysis and monotone operator theory in Hilbert spaces
- Iterative algorithm for solving the multiple-sets split equality problem with split self-adaptive step size in Hilbert spaces
This page was built for publication: Simultaneous and semi-alternating projection algorithms for solving split equality problems