How good are projection methods for convex feasibility problems?

Authors:
Nicholas I. Gould
Affiliations:
Computational Science and Engineering Department, Rutherford Appleton Laboratory, Chilton, England, UK OX11 0QX and Oxford University Computing Laboratory, Oxford, England, UK OX1 3QD
Venue:
Computational Optimization and Applications
Year:
2008

Citing 12
Cited 2

A simultaneous iterative method for computing projections on polyhedra

SIAM Journal on Control and Optimization
On some optimization techniques in image reconstruction from projections

Applied Numerical Mathematics - Applications of optimization
A successive projection method

Mathematical Programming: Series A and B
Eigenvalues and condition numbers of random matrices

SIAM Journal on Matrix Analysis and Applications
On the convergence of Han's method for convex programming with quadratic objective

Mathematical Programming: Series A and B
On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review
The Multifrontal Solution of Indefinite Sparse Symmetric Linear

ACM Transactions on Mathematical Software (TOMS)
Parallel Optimization: Theory, Algorithms and Applications

Parallel Optimization: Theory, Algorithms and Applications
A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets

SIAM Journal on Numerical Analysis
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization

ACM Transactions on Mathematical Software (TOMS)
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited

ACM Transactions on Mathematical Software (TOMS)
MA57---a code for the solution of sparse symmetric definite and indefinite systems

ACM Transactions on Mathematical Software (TOMS)

How good are extrapolated bi-projection methods for linear feasibility problems?

Computational Optimization and Applications
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider simple projection methods for solving convex feasibility problems. Both successive and sequential methods are considered, and heuristics to improve these are suggested. Unfortunately, particularly given the large literature which might make one think otherwise, numerical tests indicate that in general none of the variants considered are especially effective or competitive with more sophisticated alternatives.