An algorithm for solving the convex feasibility problem

DOI10.1504/IJOR.2007.012855MaRDI QIDQ2474684zbMATH OpenFDO

Authors Abdulwahab Al-Othman, Mohammed A. Hajeeh

Publication date 6 March 2008

Published in International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

volumetric centerseparating hyperplaneline searchesvolumetric cutting plane algorithm

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Towards a Practical Volumetric Cutting Plane Method for Convex Programming
• On Vaidya's Volumetric Cutting Plane Method for Convex Programming
• A new algorithm for minimizing convex functions over convex sets
• Polynomial Interior Point Cutting Plane Methods
• A homogenized cutting plane method to solve the convex feasibility problem.

Cited in

(5)

• scientific article; zbMATH DE number 6263278 (Why is no real title available?)
• A homogenized cutting plane method to solve the convex feasibility problem.
• Iterative algorithm for solving a class of convex feasibility problem
• Note: An algorithm to solve polyhedral convex set optimization problems
• scientific article; zbMATH DE number 6451396 (Why is no real title available?)

This page was built for publication: An algorithm for solving the convex feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474684)