On convex feasibility problems
From MaRDI portal
Approximation with constraints (41A29) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Numerical solutions to equations with nonlinear operators (65J15) Programming in abstract spaces (90C48)
Recommendations
- scientific article; zbMATH DE number 2227334
- Quasi-nonexpansivity and the convex feasibility problem
- scientific article; zbMATH DE number 7213713
- An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
- A strongly convergent parallel projection algorithm for convex feasibility problem
Cited in
(25)- On the regularity condition in a convex feasibility problem
- About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I
- A non-interior continuation algorithm for solving the convex feasibility problem
- The combination projection method for solving convex feasibility problems
- Convergence analysis of processes with valiant projection operators in Hilbert space
- Stability of a convex feasibility problem
- Algorithms for the quasiconvex feasibility problem
- An approach for the convex feasibility problem via monotropic programming
- A log-quadratic projection method for convex feasibility problems
- GOOD DEAL BOUNDS WITH CONVEX CONSTRAINTS
- scientific article; zbMATH DE number 3853857 (Why is no real title available?)
- The hybrid extragradient implicit approach for convex feasibility problems
- A composition projection method for feasibility problems and applications to equilibrium problems
- Iterative algorithm for a convex feasibility problem
- scientific article; zbMATH DE number 3912113 (Why is no real title available?)
- scientific article; zbMATH DE number 58116 (Why is no real title available?)
- scientific article; zbMATH DE number 686909 (Why is no real title available?)
- On Projection Algorithms for Solving Convex Feasibility Problems
- On an open question of Moudafi for convex feasibility problems in Hilbert spaces
- Some remarks on the convex feasibility problem and best approximation problem
- Convergence of weighted averages of relaxed projections
- Quasi-nonexpansivity and the convex feasibility problem
- scientific article; zbMATH DE number 2227334 (Why is no real title available?)
- Single-projection procedure for infinite dimensional convex optimization problems
- On a useful lemma that relates quasi-nonexpansive and demicontractive mappings in Hilbert spaces
This page was built for publication: On convex feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492312)
