A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces

DOI10.1080/02331934.2014.967237zbMath1329.65129OpenAlexW2030239401MaRDI QIDQ3453405

Phan Tu Vuong, Jean Jacques Strodiot, Van Hien Nguyen

Publication date: 27 November 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://orbilu.uni.lu/handle/10993/27784

zbMATH Keywords

strong convergencesplit equality problemsplit feasibility problemgradient projection methodrelaxed algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Fixed-point theorems (47H10)

Related Items

Newton projection method as applied to assembly simulation ⋮ Hybrid simultaneous algorithms for the split equality problem with applications ⋮ A new approach to solving split equality problems in Hilbert spaces ⋮ A new method for solving split equality problems via projection dynamical systems ⋮ Strong convergence of an iterative method for solving the multiple-set split equality fixed point problem in a real Hilbert space ⋮ A cyclic iterative method for solving the system of split equality zero-point problems ⋮ A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models ⋮ A dynamic simultaneous algorithm for solving split equality fixed point problems ⋮ Two general splitting methods with alternated inertia for solving split equality problem in Hilbert spaces ⋮ An algorithm for solving a class of bilevel split problems involving pseudomonotone equilibrium problem ⋮ Unnamed Item ⋮ An algorithm for a class of bilevel split equilibrium problems: application to a differentiated Nash-Cournot model with environmental constraints ⋮ Two hybrid algorithms for solving split equilibrium problems ⋮ A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems ⋮ New iterative regularization methods for solving split variational inclusion problems ⋮ Regularization methods for the split equality problems in Hilbert spaces

Cites Work

• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• A note on the split common fixed-point problem for quasi-nonexpansive operators
• Approximation of fixed points of nonexpansive mappings
• A multiprojection algorithm using Bregman projections in a product space
• On variable-step relaxed projection algorithm for variational inequalities
• A relaxed alternating CQ-algorithm for convex feasibility problems
• Solving the split equality problem without prior knowledge of operator norms
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative Algorithms for Nonlinear Operators
• Solving the split feasibility problem without prior knowledge of matrix norms
• A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
• A relaxed projection method for variational inequalities
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• The relaxed CQ algorithm solving the split feasibility problem
• Fixed points of nonexpanding maps