An algorithm for solving the convex feasibility problem
by Abdulwahab Al-Othman, Mohammed Hajeeh
International Journal of Operational Research (IJOR), Vol. 2, No. 3, 2007

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.

Online publication date: Mon, 19-Mar-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com