arXiv Analytics

Sign in

arXiv:2301.07632 [math.OC]AbstractReferencesReviewsResources

The ellipsoid method redux

Michael J. Todd

Published 2023-01-18Version 1

We reconsider the ellipsoid method for linear inequalities. Using the ellipsoid representation of Burrell and Todd, we show the method can be viewed as coordinate descent on the volume of an enclosing ellipsoid, or on a potential function, or on both. The method can be enhanced by improving the lower bounds generated and by allowing the weights on inequalities to be decreased as well as increased, while still guaranteeing a decrease in volume. Three different initialization schemes are described, and preliminary computational results given. Despite the improvements discussed, these are not encouraging.

Related articles: Most relevant | Search more
arXiv:1410.5925 [math.OC] (Published 2014-10-22)
Double Well Potential Function and Its Optimization in The n-dimensional Real Space -- Part I
arXiv:1306.5287 [math.OC] (Published 2013-06-22)
Some preconditioners for systems of linear inequalities
arXiv:2310.02259 [math.OC] (Published 2023-10-03)
Towards An Analytical Framework for Potential Games