The combination projection method for solving convex feasibility problems

DOI10.3390/MATH6110249zbMath1468.65071OpenAlexW2900772434MaRDI QIDQ1634718

Songnian He, Qiao-Li Dong

Publication date: 18 December 2018

Published in: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/math6110249

zbMATH Keywords

Hilbert spaceconvex feasibility problemprojection operatorcombination projection method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Methods of reduced gradient type (90C52)

Related Items (1)

A parallel combination extragradient method with Armijo line searching for finding common solutions of finite families of equilibrium and fixed point problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A simple algorithm for computing projection onto intersection of finite level sets
• Solving the variational inequality problem defined on intersection of finite level sets
• Iterative methods for fixed point problems in Hilbert spaces
• The subgradient extragradient method for solving variational inequalities in Hilbert space
• Averaged mappings and the gradient-projection algorithm
• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• A generalized projection-based scheme for solving convex constrained optimization problems
• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
• An alternating projection that does not converge in norm
• Iterative methods for strict pseudo-contractions in Hilbert spaces
• Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
• An approach for the convex feasibility problem via monotropic programming
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• The extragradient algorithm with inertial effects for solving the variational inequality
• The multiple-sets split feasibility problem and its applications for inverse problems
• A relaxed projection method for variational inequalities
• On Projection Algorithms for Solving Convex Feasibility Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Splitting methods for split feasibility problems with application to Dantzig selectors
• The Implicit Convex Feasibility Problem and Its Application to Adaptive Image Denoising
• The method of projections for finding the common point of convex sets
• Functional Operators (AM-22), Volume 2

This page was built for publication: The combination projection method for solving convex feasibility problems