The combination projection method for solving convex feasibility problems
Summary: In this paper, we propose a new method, which is called the combination projection method (CPM), for solving the convex feasibility problem (CFP) of finding some \(x^\ast \in C : = \cap_{i = 1}^m \{x \in \mathcal{H}\mid c_i(x) \leq 0 \}\), where \(m\) is a positive integer, \(\mathcal H\) is a real Hilbert space, and \(\{c_i \}_{i = 1}^m\) are convex functions defined as \(\mathcal H\). The key of the CPM is that, for the current iterate \(x^k\), the CPM firstly constructs a new level set \(H_k\) through a convex combination of some of \(\{c_i \}_{i = 1}^m\) in an appropriate way, and then updates the new iterate \(x^{k + 1}\) only by using the projection \(P_{H_k}\). We also introduce the combination relaxation projection methods (CRPM) to project onto half-spaces to make CPM easily implementable. The simplicity and easy implementation are two advantages of our methods since only one projection is used in each iteration and the projections are also easy to calculate. The weak convergence theorems are proved and the numerical results show the advantages of our methods.
- The selective projection method for convex feasibility and split feasibility problems
- On convex feasibility problems
- Block-iterative surrogate projection methods for convex feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- scientific article; zbMATH DE number 7213713
- ``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
- A relaxed projection method for variational inequalities
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- A simple algorithm for computing projection onto intersection of finite level sets
- An alternating projection that does not converge in norm
- An approach for the convex feasibility problem via monotropic programming
- Averaged mappings and the gradient-projection algorithm
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Functional Operators (AM-22), Volume 2
- scientific article; zbMATH DE number 3595777 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- Iterative methods for fixed point problems in Hilbert spaces
- Iterative methods for strict pseudo-contractions in Hilbert spaces
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Solving the variational inequality problem defined on intersection of finite level sets
- Splitting methods for split feasibility problems with application to Dantzig selectors
- The extragradient algorithm with inertial effects for solving the variational inequality
- The implicit convex feasibility problem and its application to adaptive image denoising
- The method of projections for finding the common point of convex sets
- The multiple-sets split feasibility problem and its applications for inverse problems
- The selective projection method for convex feasibility and split feasibility problems
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Incomplete projection algorithms for solving the convex feasibility problem
- Convergence analysis of processes with valiant projection operators in Hilbert space
- A learning-enhanced projection method for solving convex feasibility problems
- A parallel combination extragradient method with Armijo line searching for finding common solutions of finite families of equilibrium and fixed point problems
- scientific article; zbMATH DE number 3958587 (Why is no real title available?)
- A note on the impact of the convex combination factor of a convex combination projection algorithm
- Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems
- The selective projection method for convex feasibility and split feasibility problems
- A fast method for obtaining convex combination coefficients
This page was built for publication: The combination projection method for solving convex feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1634718)
