An algorithm for solving the convex feasibility problem
Summary: 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-center 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.
- 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.
- Iterative algorithm for solving a class of convex feasibility problem
- A homogenized cutting plane method to solve the convex feasibility problem.
- Note: An algorithm to solve polyhedral convex set optimization problems
- On Vaidya's Volumetric Cutting Plane Method for Convex Programming
- scientific article; zbMATH DE number 6451396 (Why is no real title available?)
- scientific article; zbMATH DE number 6263278 (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)
