Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
From MaRDI portal
Publication:5169443
DOI10.1080/02331934.2012.677447zbMath1292.49037OpenAlexW1967580600MaRDI QIDQ5169443
Publication date: 10 July 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2012.677447
Convex programming (90C25) Applications of mathematical programming (90C90) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37)
Related Items (4)
Unnamed Item ⋮ Convergence analysis of a parallel projection algorithm for solving convex feasibility problems ⋮ A nonmonotone projection method for constrained system of nonlinear equations ⋮ A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.
Cites Work
- Unnamed Item
- A parallel subgradient projections method for the convex feasibility problem
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- New iterative methods for linear inequalities
- Block-iterative surrogate projection methods for convex feasibility problems
- Viability criteria for differential inclusions
- The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Cyclic subgradient projections
- Linear Matrix Inequalities in System and Control Theory
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- On systems of inequalities with convex functions in the left sides
This page was built for publication: Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
