A deep cut ellipsoid algorithm for convex programming
This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent some of the numerical instabilities and theoretical drawbacks usually associated with the algorithm are also provided. Moreover, for a large class of convex programs a simple proof of its rate of convergence is given and the relation with previously known results is discussed. Finally some computational results of the deep and central cut version of the algorithm applied to a min—max stochastic queue location problem are reported.
|Date of creation:||01 Jan 1994|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: 31 10 4081111
Web page: http://www.eur.nl/ese
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ems:eureir:11633. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (RePub)
If references are entirely missing, you can add them using this form.