Several inertial methods for solving split convex feasibilities and related problems
DOI10.1007/s13398-020-00857-9zbMath1505.47092OpenAlexW3021363051MaRDI QIDQ2180876
Publication date: 15 May 2020
Published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13398-020-00857-9
Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An iterative method for solving split monotone variational inclusion and fixed point problems
- An algorithm for a class of split feasibility problems: application to a model in electricity production
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Iterative algorithms for hierarchical fixed points problems and variational inequalities
- An iterative method for common solutions of equilibrium problems and hierarchical fixed point problems
- An extragradient method for solving split feasibility and fixed point problems
- Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
- Convergence theorems for inertial KM-type algorithms
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- A multiprojection algorithm using Bregman projections in a product space
- Equilibrium programming using proximal-like algorithms
- Equilibrium problems and variational models. Based on the meeting, Erice, Italy, June 23--July 2, 2000
- \(l_1\)-\(l_2\) regularization of split feasibility problems
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- A fixed point method for solving a split feasibility problem in Hilbert spaces
- Weak convergence theorem for finding fixed points and solution of split feasibility and systems of equilibrium problems
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Shrinking projection methods involving inertial forward-backward splitting methods for inclusion problems
- Inertial accelerated algorithms for solving a split feasibility problem
- An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- Solving the split feasibility problem without prior knowledge of matrix 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
- Extragradient methods for split feasibility problems and generalized equilibrium problems in Banach spaces
- The relaxed CQ algorithm solving the split feasibility problem
- Split Feasibility and Fixed Point Problems
- A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces
This page was built for publication: Several inertial methods for solving split convex feasibilities and related problems
