Iterative algorithm for solving a class of convex feasibility problem
From MaRDI portal
Recommendations
- Iterative algorithm for a convex feasibility problem
- scientific article; zbMATH DE number 3912113
- scientific article; zbMATH DE number 3892945
- scientific article; zbMATH DE number 3249571
- On one class of iterational methods for solving problems of convex programming
- An algorithm for solving the convex feasibility problem
- An iterative algorithm for approximating convex minimization problem
- An algorithm for the convex feasibility problem
- Iterative solution of convex problems by fejer-monotone methods
- Iterative algorithms for the feasibility, variational inclusion and fixed point problems
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5310524 (Why is no real title available?)
- A block hybrid method for solving generalized equilibrium problems and convex feasibility problem
- A non-interior continuation algorithm for solving the convex feasibility problem
- A note on resistance of NPT to mixture of separable states
- A parallel subgradient projections method for the convex feasibility problem
- A simultaneous projections method for linear inequalities
- A viscosity method for solving convex feasibility problems
- Alternating projection methods.
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Bound Entanglement Can Be Activated
- Completely positive linear maps on complex matrices
- Computing a nearest symmetric positive semidefinite matrix
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Generalized Bregman projections in convex feasibility problems
- How good are projection methods for convex feasibility problems?
- Iterative algorithm for a convex feasibility problem
- Modified block iterative method for solving convex feasibility problem, equilibrium problems and variational inequality problems
- Numerical solution for bounding feasible point sets
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the Mann-type iteration and the convex feasibility problem
- On the string averaging method for sparse common fixed-point problems
- Proximity Maps for Convex Sets
- Relaxed Alternating Projection Methods
- Singular value decomposition and matrix reorderings in quantum information theory
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
- The method of projections for finding the common point of convex sets
- Variable target value relaxed alternating projection method
Cited in
(7)- An iterative algorithm for approximating convex minimization problem
- On finitely convergent iterative methods for the convex feasibility problem
- Iterative linear programming solution of convex programs
- Iterative algorithms and convergence theorems for solving \(F\)-IGVIP and \(F\)-IGCP
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- Convergence results for stochastic convex feasibility problem using random Mann and simultaneous projection iterative algorithms in Hilbert space
- scientific article; zbMATH DE number 6378119 (Why is no real title available?)
This page was built for publication: Iterative algorithm for solving a class of convex feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736385)
