Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem

The usual projection methods for solving convex feasibility problem (CFP) may lead to slow convergence for some starting points due to the 'tunnelling effect', which is connected with the monotone behaviour of the sequence and the exact orthogonal projection used in algorithms. To overcome...

Ausführliche Beschreibung