General iterative algorithms approach to variational inequalities and minimum-norm fixed point for minimization and split feasibility problems

DOI10.1007/s12597-013-0150-5zbMath1332.90342OpenAlexW1978234819WikidataQ59306982 ScholiaQ59306982MaRDI QIDQ260465

Poom Kumam, Pongsakorn Sunthrayuth, Yeol Je Cho

Publication date: 21 March 2016

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-013-0150-5

zbMATH Keywords

strong convergencefixed pointvariational inequalitynonexpansive mappingsplit feasibility problemminimum norm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48)

Related Items

General iterative methods for monotone mappings and pseudocontractive mappings related to optimization problems ⋮ Mann's type extragradient for solving split feasibility and fixed point problems of Lipschitz asymptotically quasi-nonexpansive mappings ⋮ Multiple-set split feasibility problems for \(\kappa\)-strictly pseudononspreading mapping in Hilbert spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New methods with perturbations for non-expansive mappings in Hilbert spaces
• Iterative algorithms for minimum-norm fixed point of non-expansive mapping in Hilbert space
• Multiple-set split feasibility problems for asymptotically strict pseudocontractions
• Finding minimum norm fixed point of nonexpansive mappings and applications
• Minimization of equilibrium problems, variational inequality problems and fixed point problems
• Algorithms construction for nonexpansive mappings and inverse-strongly monotone mappings
• Strong convergence of a modified extragradient method to the minimum-norm solution of variational inequalities
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• General variational inequalities and nonexpansive mappings
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• A multiprojection algorithm using Bregman projections in a product space
• An iterative approach to quadratic optimization
• Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals
• Viscosity approximation methods for nonexpansive mappings
• Minimum-norm fixed point of pseudocontractive mappings
• Implicit and explicit algorithms for minimum-norm fixed points of pseudocontractions in Hilbert spaces
• Viscosity approximation methods for fixed-points problems
• Schemes for finding minimum-norm solutions of variational inequalities
• A general iterative method for nonexpansive mappings in Hilbert spaces
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Construction of Iterative Methods for Variational Inequality and Fixed Point Problems

This page was built for publication: General iterative algorithms approach to variational inequalities and minimum-norm fixed point for minimization and split feasibility problems