Towards a practical volumetric cutting plane method for convex programming
(1998) SIAM Journal on Optimization — Vol. 9, n° 1, p. 190-206 (1998)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- We consider the volumetric cutting plane method for finding a point in a convex set C subset of R-n that is characterized by a separation oracle. We prove polynomiality of the algorithm with each added cut placed directly through the current point and show that this "central cut" version of the method can be implemented using no more than 25n constraints at any time.
- Affiliations
Citations
Anstreicher, KM. (1998). Towards a practical volumetric cutting plane method for convex programming. SIAM Journal on Optimization, 9(1), 190-206. https://doi.org/10.1137/S1052623497318013 (Original work published 1998)