An acceleration scheme for cyclic subgradient projections method

DOI10.1007/s10589-012-9490-yzbMath1267.90097OpenAlexW2095255495MaRDI QIDQ1938914

Mokhtar Abbasi, Touraj Nikazad

Publication date: 25 February 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-012-9490-y

zbMATH Keywords

iterative methodsconvex feasibility problemcyclic subgradient projections method

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (5)

A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators ⋮ Enhancement of the Kaczmarz algorithm with projection adjustment ⋮ Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations ⋮ The Averaged Kaczmarz Iteration for Solving Inverse Problems ⋮ Convergence of string-averaging method for a class of operators

Uses Software

• SNARK93

Cites Work

• Unnamed Item
• Unnamed Item
• Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
• A parallel subgradient projections method for the convex feasibility problem
• Fundamentals of Computerized Tomography
• Projections and preconditioning for inconsistent least-squares problems
• On Diagonally Relaxed Orthogonal Projection Methods
• On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
• Cyclic subgradient projections
• On Projection Algorithms for Solving Convex Feasibility Problems
• The method of projections for finding the common point of convex sets

This page was built for publication: An acceleration scheme for cyclic subgradient projections method