Incomplete projection algorithms for solving the convex feasibility problem

DOI10.1023/A:1019165330848MaRDI QIDQ1275443zbMATH OpenOpenAlexFDO

Authors F. J. González-Castaño, Ubaldo M. García-Palomares

Publication date 10 March 1999

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019165330848

zbMATH Keywords

convergenceconvergence accelerationconvex feasibility problemincomplete projection algorithmsmultiprocessingnumerical tests

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Convex programming (90C25)

Review text

The aim of the paper is to present a general scheme for the convex feasibility problem and to prove its convergence under mild conditions. The salient features of the proposed scheme are: (a) No exact projections are required. (b) An acceleration factor \(\lambda\) is introduced, which seems to play a fundamental role in improving the quality of convergence for the incomplete projection algorithms. New acceleration techniques are proposed. Preliminary numerical tests are reported on random problems characterized by linear inequalities. The speedup obtained in a multiprocessing environment is remarkable, in some cases being obtained a superlinear speedup.

Recommendations

• An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
• On Projection Algorithms for Solving Convex Feasibility Problems
• Projection algorithms for convex feasibility problem
• scientific article; zbMATH DE number 2227334
• Algorithms and convergence results of projection methods for inconsistent feasibility problems: a review
• An infeasible-interior-point algorithm using projections onto a convex set
• Convergence of projection algorithms to approximate solutions of convex feasibility problems
• scientific article; zbMATH DE number 5538161
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
• The combination projection method for solving convex feasibility problems

Cited in

(11)

• Convergence results for an accelerated nonlinear Cimmino algorithm
• An acceleration scheme for cyclic subgradient projections method
• Extrapolation algorithm for affine-convex feasibility problems
• Superlinear rate of convergence and optimal acceleration schemes in the solution of convex inequality problems.
• The relation between the weight factor and the number of steps in a projection algorithm
• PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
• Projection algorithms for convex feasibility problem
• Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
• An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
• "A visual and numerical comparative study of some parallel affine projection algorithms for solving the convex feasibility problem with application to scratch inpainting"
• An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems

This page was built for publication: Incomplete projection algorithms for solving the convex feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275443)