An optimization approach to solving the split feasibility problem in Hilbert spaces
From MaRDI portal
Publication:2022291
DOI10.1007/s10898-020-00964-2OpenAlexW3096462442MaRDI QIDQ2022291
Mai Thi Ngoc Ha, Truong Minh Tuyen, Simeon Reich
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00964-2
Convex programming (90C25) Monotone operators and generalizations (47H05) Set-valued and variational analysis (49J53) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
A generalized cyclic iterative method for solving variational inequalities over the solution set of a split common fixed point problem ⋮ Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators ⋮ Hierarchical variational inequality problem and split common fixed point of averaged operators ⋮ Inertial proximal point algorithm for the split common solution problem of monotone operator equations ⋮ The generalized Fermat-Torricelli problem in Hilbert spaces ⋮ On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces ⋮ Variational inequalities over the solution sets of split variational inclusion problems ⋮ Inertial accelerated algorithms for solving split feasibility with multiple output sets in Hilbert spaces ⋮ New iterative algorithms for solving a class of split common solution problems and their applications ⋮ New Algorithms for Solving the Split Common Zero Point Problem in Hilbert Space ⋮ Regularization methods for solving the split feasibility problem with multiple output sets in Hilbert spaces ⋮ Two new self-adaptive algorithms for solving the split feasibility problem in Hilbert space ⋮ Mann-type inertial projection and contraction method for solving split pseudomonotone variational inequality problem with multiple output sets ⋮ Inertial proximal point algorithms for solving a class of split feasibility problems ⋮ An algorithmic approach to solving split common fixed point problems for families of demicontractive operators in Hilbert spaces ⋮ Projection algorithms for solving the split feasibility problem with multiple output sets ⋮ The iterative method for solving the proximal split feasibility problem with an application to LASSO problem ⋮ Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Algorithms for the split variational inequality problem
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- A multiprojection algorithm using Bregman projections in a product space
- A hybrid extragradient method for solving pseudomonotone equilibrium problems using Bregman distance
- The split feasibility problem with multiple output sets in Hilbert spaces
- The split common null point problem in Banach spaces
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- Strong convergence of an iterative method for nonexpansive and accretive operators
- The split common null point problem and the shrinking projection method in Banach spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The Split Common Null Point Problem
- The relaxed CQ algorithm solving the split feasibility problem
- SHRINKING PROJECTION ALGORITHMS FOR THE SPLIT COMMON NULL POINT PROBLEM
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
