Cites work
- scientific article; zbMATH DE number 3919744 (Why is no real title available?)
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 2182576 (Why is no real title available?)
- scientific article; zbMATH DE number 832179 (Why is no real title available?)
- scientific article; zbMATH DE number 3200865 (Why is no real title available?)
- A modified inexact implicit method for mixed variational inequalities
- A multiprojection algorithm using Bregman projections in a product space
- A note on the CQ algorithm for the split feasibility problem
- A strongly convergent method for the split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An iterative algorithm for the variational inequality problem
- Fundamentals of equilibrium problems
- Hybrid extragradient method for general equilibrium problems and fixed point problems in Hilbert space
- Inexact proximal point method for general variational inequalities
- Iterative Algorithms for Nonlinear Operators
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- On iterative methods for equilibrium problems
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Some developments in general variational inequalities
- Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- The relaxed CQ algorithm solving the split feasibility problem
- Three-steps iterative algorithms for mixed variational inequalities
- Viscosity approximation methods for nonexpansive mappings and generalized variational inequalities
Cited in
(18)- SPLITTING NUMBER is NP-complete
- scientific article; zbMATH DE number 7559325 (Why is no real title available?)
- Graph-Theoretic Concepts in Computer Science
- Improvised divide and conquer approach for the LIS problem
- scientific article; zbMATH DE number 3843505 (Why is no real title available?)
- Efficient splitting and merging algorithms for order decomposable problems.
- scientific article; zbMATH DE number 1443580 (Why is no real title available?)
- scientific article; zbMATH DE number 17433 (Why is no real title available?)
- On the splitting problem for selections
- scientific article; zbMATH DE number 5492159 (Why is no real title available?)
- Efficient split algorithms for continuous-time and discrete-time systems
- scientific article; zbMATH DE number 4218375 (Why is no real title available?)
- scientific article; zbMATH DE number 954657 (Why is no real title available?)
- scientific article; zbMATH DE number 1262805 (Why is no real title available?)
- scientific article; zbMATH DE number 1696745 (Why is no real title available?)
- 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)
