An algorithm for solving the convex feasibility problem

Abdulwahab Al-Othman and Mohammed Hajeeh

International Journal of Operational Research, 2007, vol. 2, issue 3, 308-320

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. (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=12855 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:2:y:2007:i:3:p:308-320

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().