Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
From MaRDI portal
(Redirected from Publication:501512)
Recommendations
- A strongly convergent parallel projection algorithm for convex feasibility problem
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
- A comparative analysis of the convergence regions for different parallel affine projection algorithms
- An extrapolated parallel subgradient projection algorithm with centering technique for the convex feasibility problem
- A parallel approximate subgradient projection algorithm for convex feasibility problem
Cites work
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 2042705 (Why is no real title available?)
- A parallel subgradient projections method for the convex feasibility problem
- Block-iterative surrogate projection methods for convex feasibility problems
- Convergence of a splitting inertial proximal method for monotone operators
- Convergence theorems for inertial KM-type algorithms
- Cyclic subgradient projections
- Decomposition through formalization in a product space
- Extrapolation algorithm for affine-convex feasibility problems
- How good are projection methods for convex feasibility problems?
- Incomplete projection algorithms for solving the convex feasibility problem
- Linear Matrix Inequalities in System and Control Theory
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- The constraint consensus method for finding approximately feasible points in nonlinear programs
- Viability criteria for differential inclusions
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(11)- A strongly convergent parallel projection algorithm for convex feasibility problem
- A strongly convergent algorithm for the convex feasibility problem
- A comparative analysis of the convergence regions for different parallel affine projection algorithms
- An extrapolated parallel subgradient projection algorithm with centering technique for the convex feasibility problem
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- Algorithms and convergence results of projection methods for inconsistent feasibility problems: a review
- "A visual and numerical comparative study of some parallel affine projection algorithms for solving the convex feasibility problem with application to scratch inpainting"
- Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- scientific article; zbMATH DE number 2204206 (Why is no real title available?)
This page was built for publication: Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501512)
