Title: An algorithm for solving the convex feasibility problem

Authors: Abdulwahab Al-Othman, Mohammed Hajeeh

Addresses: Techno-Economics Division, Kuwait Institute for Scientific Research, P.O. Box 24885, Safat 13109, Kuwait. ' Techno-Economics Division, Kuwait Institute for Scientific Research, P.O. Box 24885, Safat 13109, Kuwait

Abstract: This paper presents a volumetric cutting plane algorithm for finding a feasible point in a convex set. It is based on the volumetric barrier function where Newton steps are taken and a line search is performed in order to re-centre following the addition or deletion of a constraint. The placement of the separating hyperplane in relation to the volumetric center is discussed from a theoretic perspective and then further explored in the practical implementation of the algorithm. Promising values for the parameters that have the greatest influence on the performance of the algorithm are presented.

Keywords: line searches; separating hyperplanes; volumetric cutting plane algorithms; convex feasibility; volumetric centre; operational research.

DOI: 10.1504/IJOR.2007.012855

International Journal of Operational Research, 2007 Vol.2 No.3, pp.308 - 320

Published online: 19 Mar 2007 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article