Algorithmic approach to the split problems

DOI10.1155/2013/218964zbMATH Open1291.49010OpenAlexW1990355620WikidataQ58915597 ScholiaQ58915597MaRDI QIDQ2015241FDOQ2015241

Authors: 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

Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40)

Cites Work

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

Cited In (18)

• SPLITTING NUMBER is NP-complete
• Title not available (Why is that?)
• Graph-Theoretic Concepts in Computer Science
• Improvised divide and conquer approach for the LIS problem
• Title not available (Why is that?)
• Efficient splitting and merging algorithms for order decomposable problems.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the splitting problem for selections
• Efficient split algorithms for continuous-time and discrete-time systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An elementary solution to the problem of splitting separatrices
• A solution to the Baer splitting problem
• Parameterized and Exact Computation

This page was built for publication: Algorithmic approach to the split problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015241)