An acceleration scheme for cyclic subgradient projections method

Authors:
Touraj Nikazad;Mokhtar Abbasi
Affiliations:
Department of Mathematics, Iran University of Science and Technology, Tehran, Iran 16846-13114;Department of Mathematics, Iran University of Science and Technology, Tehran, Iran 16846-13114
Venue:
Computational Optimization and Applications
Year:
2013

Citing 6
Cited 0

A parallel subgradient projections method for the convex feasibility problem

Journal of Computational and Applied Mathematics
On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review
On Diagonally Relaxed Orthogonal Projection Methods

SIAM Journal on Scientific Computing
On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces

SIAM Journal on Optimization
Fundamentals of Computerized Tomography: Image Reconstruction from Projections

Fundamentals of Computerized Tomography: Image Reconstruction from Projections
Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for solving convex feasibility problem for a finite family of convex sets is considered. The acceleration scheme of De Pierro (em Methodos de projeção para a resolução de sistemas gerais de equações algébricas lineares. Thesis (tese de Doutoramento), Instituto de Matemática da UFRJ, Cidade Universitária, Rio de Janeiro, Brasil, 1981), which is designed for simultaneous algorithms, is used in the algorithm to speed up the fully sequential cyclic subgradient projections method. A convergence proof is presented. The advantage of using this strategy is demonstrated with some examples.