Iterative algorithm for solving a class of convex feasibility problem
From MaRDI portal
Publication:1736385
DOI10.1016/j.cam.2018.11.029zbMath1410.49035OpenAlexW2904823569WikidataQ115100153 ScholiaQ115100153MaRDI QIDQ1736385
Qing-Wen Wang, Shu-Qian Shen, Xue-Feng Duan, Lin-Zhang Lu, Chun-Mei Li
Publication date: 26 March 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.11.029
quantum computationconvex feasibility problemprojection formularelaxed alternating projection algorithm
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modified block iterative method for solving convex feasibility problem, equilibrium problems and variational inequality problems
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- A note on resistance of NPT to mixture of separable states
- Variable target value relaxed alternating projection method
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
- A simultaneous projections method for linear inequalities
- Convergence results for an accelerated nonlinear Cimmino algorithm
- A parallel subgradient projections method for the convex feasibility problem
- Computing a nearest symmetric positive semidefinite matrix
- Completely positive linear maps on complex matrices
- Generalized Bregman projections in convex feasibility problems
- Numerical solution for bounding feasible point sets
- A non-interior continuation algorithm for solving the convex feasibility problem
- A block hybrid method for solving generalized equilibrium problems and convex feasibility problem
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- How good are projection methods for convex feasibility problems?
- On the Mann-type iteration and the convex feasibility problem
- Proximity Maps for Convex Sets
- Relaxed Alternating Projection Methods
- A viscosity method for solving convex feasibility problems
- On the string averaging method for sparse common fixed‐point problems
- Bound Entanglement Can Be Activated
- On Projection Algorithms for Solving Convex Feasibility Problems
- SINGULAR VALUE DECOMPOSITION AND MATRIX REORDERINGS IN QUANTUM INFORMATION THEORY
- The method of projections for finding the common point of convex sets
