IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-42056-1_11.html
   My bibliography  Save this book chapter

Nonparametric Ellipsoidal Approximation of Compact Sets of Random Points

In: Optimization and Its Applications in Control and Data Sciences

Author

Listed:
  • Sergey I. Lyashko

    (Kiev National Taras Shevchenko University)

  • Dmitry A. Klyushin

    (Kiev National Taras Shevchenko University)

  • Vladimir V. Semenov

    (Kiev National Taras Shevchenko University)

  • Maryna V. Prysiazhna

    (Kiev National Taras Shevchenko University)

  • Maksym P. Shlykov

    (Kiev National Taras Shevchenko University)

Abstract

One of the main problems of stochastic control theory is the estimation of attainability sets, or information sets. The most popular and natural approximations of such sets are ellipsoids. B.T. Polyak and his disciples use two kinds of ellipsoids covering a set of points—minimal volume ellipsoids and minimal trace ellipsoids. We propose a way to construct an ellipsoidal approximation of an attainability set using nonparametric estimations. These ellipsoids can be considered as an approximation of minimal volume ellipsoids and minimal trace ellipsoids. Their significance level depends only on the number of points and only one point from the set lays on a bound of such ellipsoid. This unique feature allows to construct a statistical depth function, rank multivariate samples and identify extreme points. Such ellipsoids in combination with traditional methods of estimation allow to increase accuracy of outer ellipsoidal approximations and estimate the probability of attaining a target set of states.

Suggested Citation

  • Sergey I. Lyashko & Dmitry A. Klyushin & Vladimir V. Semenov & Maryna V. Prysiazhna & Maksym P. Shlykov, 2016. "Nonparametric Ellipsoidal Approximation of Compact Sets of Random Points," Springer Optimization and Its Applications, in: Boris Goldengorin (ed.), Optimization and Its Applications in Control and Data Sciences, pages 327-340, Springer.
    • Handle: RePEc:spr:spochp:978-3-319-42056-1_11
    DOI: 10.1007/978-3-319-42056-1_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spochp:978-3-319-42056-1_11. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.