IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v111y2001i2d10.1023_a1011978200643.html
   My bibliography  Save this article

Multi-Input Multi-Output Ellipsoidal State Bounding

Author

Listed:
  • C. Durieu

    (Centre National de la Recherche Scientifique and École Normale Supérieure de Cachan)

  • É. Walter

    (École Supérieure d'Électricité, and Université de Paris-Sud)

  • B. Polyak

    (Russian Academy of Sciences)

Abstract

Ellipsoidal state outer bounding has been considered in the literature since the late sixties. As in the Kalman filtering, two basic steps are alternated: a prediction phase, based on the approximation of the sum of ellipsoids, and a correction phase, involving the approximation of the intersection of ellipsoids. The present paper considers the general case where K ellipsoids are involved at each step. Two measures of the size of an ellipsoid are employed to characterize uncertainty, namely, its volume and the sum of the squares of its semiaxes. In the case of multi-input multi-output state bounding, the algorithms presented lead to less pessimistic ellipsoids than the usual approaches incorporating ellipsoids one by one.

Suggested Citation

  • C. Durieu & É. Walter & B. Polyak, 2001. "Multi-Input Multi-Output Ellipsoidal State Bounding," Journal of Optimization Theory and Applications, Springer, vol. 111(2), pages 273-303, November.
    • Handle: RePEc:spr:joptap:v:111:y:2001:i:2:d:10.1023_a:1011978200643
    DOI: 10.1023/A:1011978200643
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1011978200643
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1011978200643?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. F. L. Chernousko & D. Ya. Rokityanskii, 2000. "Ellipsoidal Bounds on Reachable Sets of Dynamical Systems with Matrices Subjected to Uncertain Perturbations1," Journal of Optimization Theory and Applications, Springer, vol. 104(1), pages 1-19, January.
    2. B. T. Polyak, 1998. "Convexity of Quadratic Transformations and Its Use in Control and Optimization," Journal of Optimization Theory and Applications, Springer, vol. 99(3), pages 553-583, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhang, Liang & Feng, Zhiguang & Jiang, Zhengyi & Zhao, Ning & Yang, Yang, 2020. "Improved results on reachable set estimation of singular systems," Applied Mathematics and Computation, Elsevier, vol. 385(C).
    2. Yongchun Jiang & Hongli Yang & Ivan Ganchev Ivanov, 2024. "Reachable Set Estimation and Controller Design for Linear Time-Delayed Control System with Disturbances," Mathematics, MDPI, vol. 12(2), pages 1-10, January.
    3. Nguyen D. That & Phan T. Nam & Q. P. Ha, 2013. "Reachable Set Bounding for Linear Discrete-Time Systems with Delays and Bounded Disturbances," Journal of Optimization Theory and Applications, Springer, vol. 157(1), pages 96-107, April.
    4. Liao, Wei & Liang, Taotao & Wei, Xiaohui & Yin, Qiaozhi, 2022. "Probabilistic reach-Avoid problems in nondeterministic systems with time-Varying targets and obstacles," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    5. Amirreza Fahim Golestaneh, 2022. "A Closed-Form Parametrization and an Alternative Computational Algorithm for Approximating Slices of Minkowski Sums of Ellipsoids in R 3," Mathematics, MDPI, vol. 11(1), pages 1-21, December.
    6. Ligang Sun & Hamza Alkhatib & Boris Kargoll & Vladik Kreinovich & Ingo Neumann, 2019. "Ellipsoidal and Gaussian Kalman Filter Model for Discrete-Time Nonlinear Systems," Mathematics, MDPI, vol. 7(12), pages 1-22, December.

    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. Fabián Flores-Bazán & William Echegaray & Fernando Flores-Bazán & Eladio Ocaña, 2017. "Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap," Journal of Global Optimization, Springer, vol. 69(4), pages 823-845, December.
    2. de Klerk, E., 2006. "The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey," Discussion Paper 2006-85, Tilburg University, Center for Economic Research.
    3. Zhuoyi Xu & Linbin Li & Yong Xia, 2023. "A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(1), pages 93-109, August.
    4. J. B. Lasserre & J. B. Hiriart-Urruty, 2002. "Mathematical Properties of Optimization Problems Defined by Positively Homogeneous Functions," Journal of Optimization Theory and Applications, Springer, vol. 112(1), pages 31-52, January.
    5. A. Baccari & B. Samet, 2009. "An Extension of Polyak’s Theorem in a Hilbert Space," Journal of Optimization Theory and Applications, Springer, vol. 140(3), pages 409-418, March.
    6. Shenglong Hu & Guoyin Li & Liqun Qi, 2016. "A Tensor Analogy of Yuan’s Theorem of the Alternative and Polynomial Optimization with Sign structure," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 446-474, February.
    7. B. S. Mordukhovich & M. E. Sarabi, 2017. "Stability Analysis for Composite Optimization Problems and Parametric Variational Systems," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 554-577, February.
    8. Etienne Klerk, 2008. "The complexity of optimizing over a simplex, hypercube or sphere: a short survey," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(2), pages 111-125, June.
    9. Huu-Quang Nguyen & Ruey-Lin Sheu, 2019. "Geometric properties for level sets of quadratic functions," Journal of Global Optimization, Springer, vol. 73(2), pages 349-369, February.
    10. Immanuel Bomze & Markus Gabl, 2021. "Interplay of non-convex quadratically constrained problems with adjustable robust optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 115-151, February.
    11. H. Tuy & H. Tuan, 2013. "Generalized S-Lemma and strong duality in nonconvex quadratic programming," Journal of Global Optimization, Springer, vol. 56(3), pages 1045-1072, July.
    12. de Klerk, E., 2008. "The complexity of optimizing over a simplex, hypercube or sphere : A short survey," Other publications TiSEM 485b6860-cf1d-4cad-97b8-2, Tilburg University, School of Economics and Management.
    13. Mengmeng Song & Yong Xia, 2023. "Calabi-Polyak convexity theorem, Yuan’s lemma and S-lemma: extensions and applications," Journal of Global Optimization, Springer, vol. 85(3), pages 743-756, March.
    14. Kürşad Derinkuyu & Mustafa Pınar, 2006. "On the S-procedure and Some Variants," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 55-77, August.
    15. Gabriel Haeser, 2017. "An Extension of Yuan’s Lemma and Its Applications in Optimization," Journal of Optimization Theory and Applications, Springer, vol. 174(3), pages 641-649, September.
    16. Guoyin Li, 2012. "Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 710-726, March.
    17. M. Ruiz Galán, 2017. "A theorem of the alternative with an arbitrary number of inequalities and quadratic programming," Journal of Global Optimization, Springer, vol. 69(2), pages 427-442, October.
    18. Steven Duda & Edeltraud Gehrig & Thomas Lorenz, 2022. "External Ellipsoidal Approximations for Set Evolution Equations," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 759-798, March.
    19. de Klerk, E., 2006. "The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey," Other publications TiSEM 88640b6d-5240-472d-8669-4, Tilburg University, School of Economics and Management.
    20. Sheng-Long Hu & Zheng-Hai Huang, 2012. "Theorems of the Alternative for Inequality Systems of Real Polynomials," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 1-16, July.

    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:111:y:2001:i:2:d:10.1023_a:1011978200643. 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.