The combination projection method for solving convex feasibility problems
From MaRDI portal
Recommendations
- 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
Cites work
- 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?)
- 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
- 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
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
Cited in
(9)- A note on the impact of the convex combination factor of a convex combination projection algorithm
- The selective projection method for convex feasibility and split feasibility problems
- A parallel combination extragradient method with Armijo line searching for finding common solutions of finite families of equilibrium and fixed point problems
- A learning-enhanced projection method for solving convex feasibility problems
- Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems
- A fast method for obtaining convex combination coefficients
- Convergence analysis of processes with valiant projection operators in Hilbert space
- scientific article; zbMATH DE number 3958587 (Why is no real title available?)
- Incomplete projection algorithms for solving the convex feasibility problem
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)
