IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v136y2008i2d10.1007_s10957-007-9295-9.html
   My bibliography  Save this article

Computing Minimum-Volume Enclosing Axis-Aligned Ellipsoids

Author

Listed:
  • P. Kumar

    (Florida State University)

  • E. A. Yıldırım

    (Bilkent University)

Abstract

Given a set of points $\mathcal{S}=\{x^{1},\ldots,x^{m}\}\subset \mathbb{R}^{n}$ and ε>0, we propose and analyze an algorithm for the problem of computing a (1+ε)-approximation to the minimum-volume axis-aligned ellipsoid enclosing $\mathcal{S}$ . We establish that our algorithm is polynomial for fixed ε. In addition, the algorithm returns a small core set $\mathcal{X}\subseteq \mathcal{S}$ , whose size is independent of the number of points m, with the property that the minimum-volume axis-aligned ellipsoid enclosing $\mathcal{X}$ is a good approximation of the minimum-volume axis-aligned ellipsoid enclosing $\mathcal{S}$ . Our computational results indicate that the algorithm exhibits significantly better performance than the theoretical worst-case complexity estimate.

Suggested Citation

  • P. Kumar & E. A. Yıldırım, 2008. "Computing Minimum-Volume Enclosing Axis-Aligned Ellipsoids," Journal of Optimization Theory and Applications, Springer, vol. 136(2), pages 211-228, February.
    • Handle: RePEc:spr:joptap:v:136:y:2008:i:2:d:10.1007_s10957-007-9295-9
    DOI: 10.1007/s10957-007-9295-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-007-9295-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-007-9295-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Leonid G. Khachiyan, 1996. "Rounding of Polytopes in the Real Number Model of Computation," Mathematics of Operations Research, INFORMS, vol. 21(2), pages 307-320, May.
    2. P. Kumar & E. A. Yildirim, 2005. "Minimum-Volume Enclosing Ellipsoids and Core Sets," Journal of Optimization Theory and Applications, Springer, vol. 126(1), pages 1-21, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Karim Abou-Moustafa & Frank P. Ferrie, 2018. "Local generalized quadratic distance metrics: application to the k-nearest neighbors classifier," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(2), pages 341-363, June.
    2. Selin Ahipaşaoğlu, 2015. "Fast algorithms for the minimum volume estimator," Journal of Global Optimization, Springer, vol. 62(2), pages 351-370, June.
    3. Zhong, Zhiming & Fan, Neng & Wu, Lei, 2023. "A hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity market," European Journal of Operational Research, Elsevier, vol. 306(2), pages 909-926.
    4. Pepper, Nick & Crespo, Luis & Montomoli, Francesco, 2022. "Adaptive learning for reliability analysis using Support Vector Machines," Reliability Engineering and System Safety, Elsevier, vol. 226(C).
    5. Deyi Liu & Volkan Cevher & Quoc Tran-Dinh, 2022. "A Newton Frank–Wolfe method for constrained self-concordant minimization," Journal of Global Optimization, Springer, vol. 83(2), pages 273-299, June.
    6. Wei-jie Cong & Hong-wei Liu & Feng Ye & Shui-sheng Zhou, 2012. "Rank-two update algorithms for the minimum volume enclosing ellipsoid problem," Computational Optimization and Applications, Springer, vol. 51(1), pages 241-257, January.
    7. Mohit Singh & Weijun Xie, 2020. "Approximation Algorithms for D -optimal Design," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1512-1534, November.
    8. Jiajia Li & Jinfu Liu & Peigang Yan & Xingshuo Li & Guowen Zhou & Daren Yu, 2021. "Operation Optimization of Integrated Energy System under a Renewable Energy Dominated Future Scene Considering Both Independence and Benefit: A Review," Energies, MDPI, vol. 14(4), pages 1-36, February.
    9. Peng Sun & Robert M. Freund, 2004. "Computation of Minimum-Volume Covering Ellipsoids," Operations Research, INFORMS, vol. 52(5), pages 690-706, October.
    10. Piyush Kumar & E. Alper Yıldırım, 2009. "An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 614-629, November.
    11. Rosa, Samuel & Harman, Radoslav, 2022. "Computing minimum-volume enclosing ellipsoids for large datasets," Computational Statistics & Data Analysis, Elsevier, vol. 171(C).
    12. Piyush Kumar & E. Alper Yıldırım, 2011. "A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 377-391, August.
    13. Sanjay Mehrotra & Zhifeng Li, 2011. "Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices," Journal of Global Optimization, Springer, vol. 49(4), pages 623-649, April.
    14. Pronzato, Luc, 2013. "A delimitation of the support of optimal designs for Kiefer’s ϕp-class of criteria," Statistics & Probability Letters, Elsevier, vol. 83(12), pages 2721-2728.
    15. Alexandre Belloni, 2008. "Norm-Induced Densities and Testing the Boundedness of a Convex Set," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 235-256, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:136:y:2008:i:2:d:10.1007_s10957-007-9295-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.