Regularized gradient-projection algorithm for solving one-parameter nonexpansive semigroup, constrained convex minimization and generalized equilibrium problems
From MaRDI portal
Publication:5203986
Recommendations
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- A common solution of equilibrium, constrained convex minimization and fixed point problems
- An iterative method for nonexpansive semigroups, variational inclusions and generalized equilibrium problems
- Strong convergence of composite general iterative methods for one-parameter nonexpansive semigroup and equilibrium problems
Cites work
- scientific article; zbMATH DE number 6828873 (Why is no real title available?)
- scientific article; zbMATH DE number 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 1424529 (Why is no real title available?)
- scientific article; zbMATH DE number 3398324 (Why is no real title available?)
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- A general iterative method for nonexpansive mappings in Hilbert spaces
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
- A new method for solving equilibrium problem fixed point problem and variational inequality problem with application to optimization
- An alternating projection that does not converge in norm
- An explicit method for systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings
- An iterative method for nonexpansive semigroups, variational inclusions and generalized equilibrium problems
- Averaged mappings and the gradient-projection algorithm
- Convergence theorems based on hybrid methods for generalized equilibrium problems and fixed point problems
- Fixed points approximation and solutions of some equilibrium and variational inequalities problems
- Further investigation into split common fixed point problem for demicontractive operators
- General iterative methods for a one-parameter nonexpansive semigroup in Hilbert space
- General iterative methods for equilibrium and constrained convex minimization problem
- Iterative methods for equilibrium and fixed point problems for nonexpansive semigroups in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Split equality for monotone inclusion problem and fixed point problem in real Banach spaces
- Strong convergence to common fixed points of families of nonexpansive mappings
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
Cited in
(3)- Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
- An extragradient inertial algorithm for solving split fixed-point problems of demicontractive mappings, with equilibrium and variational inequality problems
- Inertial method for split null point problems with pseudomonotone variational inequality problems
This page was built for publication: Regularized gradient-projection algorithm for solving one-parameter nonexpansive semigroup, constrained convex minimization and generalized equilibrium problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203986)
