Algorithmic approach to the split problems

DOI10.1155/2013/218964zbMath1291.49010WikidataQ58915597 ScholiaQ58915597MaRDI QIDQ2015241

Ming Ma

Publication date: 23 June 2014

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/218964

Mathematics Subject Classification ID

49J40: Variational inequalities

47J25: Iterative procedures involving nonlinear operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
• Hybrid extragradient method for general equilibrium problems and fixed point problems in Hilbert space
• A strongly convergent method for the split feasibility problem
• Inexact proximal point method for general variational inequalities
• Three-steps iterative algorithms for mixed variational inequalities
• Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space
• A modified inexact implicit method for mixed variational inequalities
• An iterative algorithm for the variational inequality problem
• A multiprojection algorithm using Bregman projections in a product space
• Some developments in general variational inequalities
• On iterative methods for equilibrium problems
• Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative Algorithms for Nonlinear Operators
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• The relaxed CQ algorithm solving the split feasibility problem
• Fundamentals of equilibrium problems
• A note on the CQ algorithm for the split feasibility problem