Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
From MaRDI portal
Publication:501512
DOI10.3934/NACO.2016023zbMATH Open1355.49029OpenAlexW2567040129MaRDI QIDQ501512FDOQ501512
Authors: Jie Sun, Fanwen Meng, Yazheng 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
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
Convex programming (90C25) Applications of mathematical programming (90C90) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Linear Matrix Inequalities in System and Control Theory
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Convergence of a splitting inertial proximal method for monotone operators
- Convergence theorems for inertial KM-type algorithms
- Title not available (Why is that?)
- How good are projection methods for convex feasibility problems?
- Decomposition through formalization in a product space
- A parallel subgradient projections method for the convex feasibility problem
- Cyclic subgradient projections
- Extrapolation algorithm for affine-convex feasibility problems
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- The constraint consensus method for finding approximately feasible points in nonlinear programs
- Title not available (Why is that?)
- Incomplete projection algorithms for solving the convex feasibility problem
- Block-iterative surrogate projection methods for convex feasibility problems
- Viability criteria for differential inclusions
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
Cited In (10)
- 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
- 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
- Title not available (Why is that?)
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)
