The Mathematical Institute, University of Oxford, Eprints Archive

How good are projection methods for convex feasibility problems?

Gould, Nicholas I. M. (2007) How good are projection methods for convex feasibility problems? Technical Report. Unspecified. (Submitted)

[img]
Preview
PDF
193Kb

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.

Item Type:Technical Report (Technical Report)
Subjects:H - N > Numerical analysis
Research Groups:Numerical Analysis Group
ID Code:1100
Deposited By:Lotti Ekert
Deposited On:07 May 2011 09:01
Last Modified:07 May 2011 09:01

Repository Staff Only: item control page