An iterative algorithm for fixed point problem and convex minimization problem with applications
DOI10.1186/s13663-014-0253-6zbMath1333.47050OpenAlexW2098160432WikidataQ59436155 ScholiaQ59436155MaRDI QIDQ2017665
Publication date: 23 March 2015
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13663-014-0253-6
strong convergenceHilbert spacesconvex minimization problemstrictly pseudocontractive mapping\(k\)-strictly pseudo contractive mapping
Nonlinear accretive operators, dissipative operators, etc. (47H06) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative methods for mixed equilibrium problems and strictly pseudocontractive mappings
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Iterative methods for family of strictly pseudocontractive mappings and system of generalized mixed equilibrium problems and variational inequality problems
- Averaged mappings and the gradient-projection algorithm
- Strong convergence for a countable family of strict pseudocontractions in -uniformly smooth Banach spaces
- A general iterative method for equilibrium problems and strict pseudo-contractions in Hilbert spaces
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
- Convergence theorems of fixed points for \(\kappa \)-strict pseudo-contractions in Hilbert spaces
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Strong convergence theorems for solving equilibrium problems and fixed point problems of \(\xi \)-strict pseudo-contraction mappings by two hybrid projection methods
- Convergence of the Mann iteration algorithm for a class of pseudocontractive mappings
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- A multiprojection algorithm using Bregman projections in a product space
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Some results on strictly pseudocontractive nonself-mappings and equilibrium problems in Hilbert spaces
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Iterative methods for strict pseudo-contractions in Hilbert spaces
- An iterative scheme for equilibrium problems and fixed point problems of strict pseudo-contraction mappings
- Construction of fixed points of nonlinear mappings in Hilbert space
- Donsker's Delta Function and the Covariance between Generalized Functionals
- Solving the split feasibility problem without prior knowledge of matrix norms
- Projection methods for variational inequalities with application to the traffic assignment problem
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
This page was built for publication: An iterative algorithm for fixed point problem and convex minimization problem with applications