Iterative scheme for finding solutions of the general split feasibility problem and the general constrained minimization problems
From MaRDI portal
(Redirected from Publication:5080293)
Recommendations
- Applications of the S-iteration process to constrained minimization problems and split feasibility problems
- Iterative algorithms for split variational inequalities and generalized split feasibility problems with applications
- General iterative algorithms approach to variational inequalities and minimum-norm fixed point for minimization and split feasibility problems
- A new iterative method for the split feasibility problem
- An iterative method for solving proximal split feasibility problems and fixed point problems
- An iterative method for solution of finite families of split minimization problems and fixed point problems
- The general iterative methods for a split feasibility problem and a mixed equilibrium problem in a Hilbert space
- An iterative method for the split feasibility problem with a variable step
- Iterative methods for generalized split feasibility problems in Hilbert spaces
- A new iterative algorithm for split feasibility and fixed point problems
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A note on the multiple-set split convex feasibility problem in Hilbert space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Algorithms for the split variational inequality problem
- An extragradient method for solving split feasibility and fixed point problems
- An iterative approach to quadratic optimization
- General split feasibility problems in Hilbert spaces
- Introduction to nonlinear and convex analysis
- Iterative Algorithms for Nonlinear Operators
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Nonlinear functional analysis. Fixed point theory and its applications
- The Mann-type extragradient iterative algorithms with regularization for solving variational inequality problems, split feasibility, and fixed point problems
- The multiple-sets split feasibility problem and its applications for inverse problems
- Variational inequalities
Cited in
(9)- An intermixed iteration for constrained convex minimization problem and split feasibility problem
- An iterative method for the split feasibility problem with a variable step
- The method for solving the extension of general of the split feasibility problem and fixed point problem of the cutter
- A note on the general split common fixed point problem in Hilbert spaces
- Alternated multi-step inertial iterative algorithm for solving the split feasibility problem in Hilbert spaces
- The approximate solution of the general split variational inequality problem by intermixed iteration
- Self-adaptive CQ-type algorithms for the split feasibility problem involving two bounded linear operators in Hilbert spaces
- Iterative methods for solving split common fixed-point problems with a weakened condition on step sizes
- An inertial algorithm for the general split feasibility problem with an application to bandwidth allocation
This page was built for publication: Iterative scheme for finding solutions of the general split feasibility problem and the general constrained minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080293)
