Report
How good are projection methods for convex feasibility problems?
- 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.
Actions
Access Document
- Files:
-
-
(Preview, pdf, 193.2KB, Terms of use)
-
- Publisher copy:
- 10.1007/s10589-007-9073-5
Authors
- Publisher:
- Unspecified
- Publication date:
- 2007-02-01
- DOI:
- ISSN:
-
0926-6003
- UUID:
-
uuid:ac65c2dd-53a4-4e2d-80eb-75bd53693691
- Local pid:
-
oai:eprints.maths.ox.ac.uk:1100
- Deposit date:
-
2011-05-20
- ARK identifier:
Terms of use
- Copyright date:
- 2007
If you are the owner of this record, you can report an update to it here: Report update to this record