New self-adaptive step size algorithms for solving split variational inclusion problems and its applications
DOI10.1007/s11075-019-00683-0zbMath1486.65067OpenAlexW2923893934WikidataQ128177896 ScholiaQ128177896MaRDI QIDQ2287866
Publication date: 22 January 2020
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-019-00683-0
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Set-valued and variational analysis (49J53) Iterative procedures involving nonlinear operators (47J25) Numerical methods based on nonlinear programming (49M37) Programming in abstract spaces (90C48)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving proximal split feasibility problems without prior knowledge of operator norms
- Split monotone variational inclusions
- Algorithms for the split variational inequality problem
- An extragradient method for solving split feasibility and fixed point problems
- Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- A multiprojection algorithm using Bregman projections in a product space
- An iterative approach to quadratic optimization
- \(l_1\)-\(l_2\) regularization of split feasibility problems
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
- An iterative method for split inclusion problems without prior knowledge of operator norms
- Convergence analysis of a general iterative algorithm for finding a common solution of split variational inclusion and optimization problems
- The split common null point problem in Banach spaces
- An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping
- The split common null point problem and the shrinking projection method in Banach spaces
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- Iterative Algorithms for Nonlinear Operators
- Solving the split feasibility problem without prior knowledge of matrix norms
- The split common fixed-point problem for demicontractive mappings
- 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
- On the convergence of the forward-backward algorithm for null-point problems
- The Split Common Null Point Problem
- The relaxed CQ algorithm solving the split feasibility problem
- Split Feasibility and Fixed Point Problems
- Nonlinear iterative methods for solving the split common null point problem in Banach spaces
- Fixed points of nonexpanding maps
- A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces
This page was built for publication: New self-adaptive step size algorithms for solving split variational inclusion problems and its applications