Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
From MaRDI portal
Publication:501512
DOI10.3934/naco.2016023zbMath1355.49029OpenAlexW2567040129MaRDI QIDQ501512
Jie Sun, Fanwen Meng, Ya-Zheng Dang
Publication date: 9 January 2017
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2016023
Convex programming (90C25) Applications of mathematical programming (90C90) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence theorems for inertial KM-type algorithms
- A parallel subgradient projections method for the convex feasibility problem
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Incomplete projection algorithms for solving the convex feasibility problem
- Block-iterative surrogate projection methods for convex feasibility problems
- Convergence of a splitting inertial proximal method for monotone operators
- Viability criteria for differential inclusions
- How good are projection methods for convex feasibility problems?
- Extrapolation algorithm for affine-convex feasibility problems
- The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
- Decomposition through formalization in a product space
- Cyclic subgradient projections
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- Linear Matrix Inequalities in System and Control Theory
- On Projection Algorithms for Solving Convex Feasibility Problems
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
This page was built for publication: Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
