Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems
From MaRDI portal
Publication:4639143
DOI10.1080/02331934.2017.1405955zbMath1409.90225OpenAlexW2768931700MaRDI QIDQ4639143
Yekini Shehu, Olaniyi Samuel Iyiola
Publication date: 3 May 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1405955
Related Items
New inertial method for generalized split variational inclusion problems, Parallel proximal method of solving split system of fixed point set constraint minimization problems, Proximal method of solving split system of minimization problem, Unnamed Item, The iterative method for solving the proximal split feasibility problem with an application to LASSO problem, A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications, An iterative method for solving proximal split feasibility problems and fixed point problems, Convergence of an Inertial Shadow Douglas-Rachford Splitting Algorithm for Monotone Inclusions
Cites Work
- Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
- Iterative approximation of solutions for proximal split feasibility problems
- Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
- An iterative method for solving split monotone variational inclusion and fixed point problems
- Hierarchical convergence of an implicit double-net algorithm for nonexpansive semigroups and variational inequality problems
- Regularized methods for the split feasibility problem
- Iterative methods for fixed point problems in Hilbert spaces
- Solving proximal split feasibility problems without prior knowledge of operator norms
- Convergence of hybrid steepest-descent methods for variational inequalities
- Split monotone variational inclusions
- Algorithms for the split variational inequality problem
- The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for convex proximal split feasibility problems and fixed point problems
- A regularized algorithm for the proximal split feasibility problem
- Iterative methods for solving proximal split minimization problems
- A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem
- Two-step projection methods for a system of variational inequality problems in Banach spaces
- Convergence analysis for proximal split feasibility problems and fixed point problems
- Approximation of common solutions to proximal split feasibility problems and fixed point problems
- Solving the split feasibility problem without prior knowledge of matrix norms
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Strong convergence result for proximal split feasibility problem in Hilbert spaces
- Nonlinear iteration method for proximal split feasibility problems
- The Split Common Null Point Problem
- The relaxed CQ algorithm solving the split feasibility problem
- Split Feasibility and Fixed Point Problems
- Generalized KM theorems and their applications
- On the Maximality of Sums of Nonlinear Monotone Operators
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
