The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems
DOI10.1155/2014/365203zbMATH Open1472.47070OpenAlexW2019635169WikidataQ59036678 ScholiaQ59036678MaRDI QIDQ1723940FDOQ1723940
Authors: Jitsupa Deepho, Poom Kumam 
Publication date: 14 February 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/365203
Recommendations
- The conjugate gradient method for split variational inclusion and constrained convex minimization problems
- Hybrid steepest descent method for split variational inclusion and finite family of nonexpansive mappings
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Hybrid steepest-descent methods for systems of variational inequalities with constraints of variational inclusions and convex minimization problems
- A hybrid steepest descent method for a split feasibility problem in Hilbert spaces
Variational and other types of inclusions (47J22) Iterative procedures involving nonlinear operators (47J25)
Cites Work
- A multiprojection algorithm using Bregman projections in a product space
- Iterative oblique projection onto convex sets and the split feasibility problem
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Algorithms for the split variational inequality problem
- An iterative approach to quadratic optimization
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- Title not available (Why is that?)
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The split common null point problem
- Strong convergence to common fixed points of infinite nonexpansive mappings and applications
- Split monotone variational inclusions
- Averaged mappings and the gradient-projection algorithm
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- A general iterative method for obtaining an infinite family of strictly pseudo-contractive mappings in Hilbert spaces
- An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping
- Title not available (Why is that?)
- General iterative methods for system of equilibrium problems and constrained convex minimization problem in Hilbert spaces
Cited In (7)
- Split Variational Inclusion Problem and Fixed Point Problem for Asymptotically Nonexpansive Semigroup with Application to Optimization Problem
- PARALLEL EXTRAGRADIENT-PROXIMAL METHODS FOR SPLIT EQUILIBRIUM PROBLEMS
- A hybrid steepest descent method for constrained convex optimization
- Viscosity self-adaptive method for generalized split system of variational inclusion problem
- Convergence analysis of a new iterative algorithm for solving split variational inclusion problems
- Strong convergence of a hybrid steepest descent method for the split common fixed point problem
- Title not available (Why is that?)
This page was built for publication: The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1723940)
