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

LMI Approximations for the Radius of the Intersection of Ellipsoids: Survey

Author

Listed:
  • D. Henrion

    (Centre National de la Recherche Scientifique)

  • S. Tarbouriech

    (Centre National de la Recherche Scientifique)

  • D. Arzelier

    (Centre National de la Recherche Scientifique)

Abstract

This paper surveys various linear matrix inequality relaxation techniques for evaluating the maximum norm vector within the intersection of several ellipsoids. This difficult nonconvex optimization problem arises frequently in robust control synthesis. Two randomized algorithms and several ellipsoidal approximations are described. Guaranteed approximation bounds are derived in order to evaluate the quality of these relaxations.

Suggested Citation

  • D. Henrion & S. Tarbouriech & D. Arzelier, 2001. "LMI Approximations for the Radius of the Intersection of Ellipsoids: Survey," Journal of Optimization Theory and Applications, Springer, vol. 108(1), pages 1-28, January.
    • Handle: RePEc:spr:joptap:v:108:y:2001:i:1:d:10.1023_a:1026454804250
    DOI: 10.1023/A:1026454804250
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1026454804250
    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:1026454804250?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. NESTEROV, Yu., 1998. "Semidefinite relaxation and nonconvex quadratic optimization," LIDAM Reprints CORE 1362, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    3. Minyue Fu & Zhi-Quan Luo & Yinyu Ye, 1998. "Approximation Algorithms for Quadratic Programming," Journal of Combinatorial Optimization, Springer, vol. 2(1), pages 29-50, March.
    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. Andreas Rauh & Stefan Wirtensohn & Patrick Hoher & Johannes Reuter & Luc Jaulin, 2022. "Reliability Assessment of an Unscented Kalman Filter by Using Ellipsoidal Enclosure Techniques," Mathematics, MDPI, vol. 10(16), pages 1-18, August.
    2. 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.
    3. Tongli Zhang & Yong Xia, 2022. "Comment on “Approximation algorithms for quadratic programming”," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1099-1103, September.

    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. Sturm, J.F. & Zhang, S., 2001. "On Cones of Nonnegative Quadratic Functions," Discussion Paper 2001-26, Tilburg University, Center for Economic Research.
    2. Hezhi Luo & Xiaodong Ding & Jiming Peng & Rujun Jiang & Duan Li, 2021. "Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 180-197, January.
    3. Xiaodong Ding & Hezhi Luo & Huixian Wu & Jianzhen Liu, 2021. "An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation," Computational Optimization and Applications, Springer, vol. 80(1), pages 89-120, September.
    4. Jos F. Sturm & Shuzhong Zhang, 2003. "On Cones of Nonnegative Quadratic Functions," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 246-267, May.
    5. Zhuoyi Xu & Yong Xia & Jiulin Wang, 2021. "Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension," Journal of Global Optimization, Springer, vol. 80(2), pages 341-356, June.
    6. Christina Büsing & Sigrid Knust & Xuan Thanh Le, 2018. "Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 339-365, December.
    7. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    8. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    9. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    10. Chuong, T.D. & Jeyakumar, V., 2017. "Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 381-399.
    11. Jiao, Hongwei & Liu, Sanyang & Lu, Nan, 2015. "A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 973-985.
    12. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    13. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    14. Dranichak, Garrett M. & Wiecek, Margaret M., 2019. "On highly robust efficient solutions to uncertain multiobjective linear programs," European Journal of Operational Research, Elsevier, vol. 273(1), pages 20-30.
    15. M. J. Naderi & M. S. Pishvaee, 2017. "Robust bi-objective macroscopic municipal water supply network redesign and rehabilitation," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(9), pages 2689-2711, July.
    16. Evers, L. & Dollevoet, T.A.B. & Barros, A.I. & Monsuur, H., 2011. "Robust UAV Mission Planning," Econometric Institute Research Papers EI 2011-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    17. Vaughn Gambeta & Roy Kwon, 2020. "Risk Return Trade-Off in Relaxed Risk Parity Portfolio Optimization," JRFM, MDPI, vol. 13(10), pages 1-28, October.
    18. J. Behnamian & Z. Gharabaghli, 2023. "Multi-objective outpatient scheduling in health centers considering resource constraints and service quality: a robust optimization approach," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-35, March.
    19. Mínguez, R. & García-Bertrand, R., 2016. "Robust transmission network expansion planning in energy systems: Improving computational performance," European Journal of Operational Research, Elsevier, vol. 248(1), pages 21-32.
    20. Stein, Oliver, 2012. "How to solve a semi-infinite optimization problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 312-320.

    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:108:y:2001:i:1:d:10.1023_a:1026454804250. 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.