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

ePubs

The open archive for STFC research publications

Persistent URL	http://purl.org/net/epubs/work/55933
Record Status	Checked
Record Id	55933
Title	How good are extrapolated bi-projection methods for linear feasibility problems?
Contributors	NIM Gould (STFC Rutherford Appleton Lab.)
Abstract	We consider extrapolated projection methods for solving linear feasibility problems. Both successive and sequential methods of a two-set projection scheme are examined. The best algorithm in the class of algorithms that we considered was an extrapolated sequential method. When this was compared to an interior point method using the CUTEr/Netlib linear programming test problems it was found that the bi-projection method was fastest (or equal fastest) for 31% of the cases, while the interior point code was fastest in 71% of the cases. The interior-point method succeeded on all examples, but the best bi-projection method considered here failed to solve 37% of the problems within reasonable CPU time or iteration thresholds.
Organisation	CSE , CSE-NAG , STFC
Keywords
Funding Information
Related Research Object(s):
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Report	RAL Technical Reports RAL-TR-2011-009. 2011.		RAL-TR-2011-009.pdf	2011
Journal Article	Computational Optimization and Applications 51, no. 3 (2012): 1089-1095.	doi:10.1007/s10589-011-9414-2		2012