IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v55y2013i2p209-226.html
   My bibliography  Save this article

Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty

Author

Listed:
  • V. Jeyakumar
  • G. Li

Abstract

In this paper we examine non-convex quadratic optimization problems over a quadratic constraint under unknown but bounded interval perturbation of problem data in the constraint and develop criteria for characterizing robust (i.e. uncertainty-immunized) global solutions of classes of non-convex quadratic problems. Firstly, we derive robust solvability results for quadratic inequality systems under parameter uncertainty. Consequently, we obtain characterizations of robust solutions for uncertain homogeneous quadratic problems, including uncertain concave quadratic minimization problems and weighted least squares. Using homogenization, we also derive characterizations of robust solutions for non-homogeneous quadratic problems. Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • V. Jeyakumar & G. Li, 2013. "Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty," Journal of Global Optimization, Springer, vol. 55(2), pages 209-226, February.
    • Handle: RePEc:spr:jglopt:v:55:y:2013:i:2:p:209-226
    DOI: 10.1007/s10898-012-9857-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-9857-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-9857-8?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. Vaithilingam Jeyakumar & Zhiyou Wu, 2007. "Conditions For Global Optimality Of Quadratic Minimization Problems With Lmi Constraints," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(02), pages 149-160.
    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.
    3. Dimitris Bertsimas & David B. Brown, 2009. "Constructing Uncertainty Sets for Robust Linear Optimization," Operations Research, INFORMS, vol. 57(6), pages 1483-1495, 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. F. Domes & A. Goldsztejn, 2017. "A branch and bound algorithm for quantified quadratic programming," Journal of Global Optimization, Springer, vol. 68(1), pages 1-22, May.

    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. 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.
    2. 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.
    3. 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.
    4. Wu, Zhiyou & Tian, Jing & Ugon, Julien & Zhang, Liang, 2015. "Global optimality conditions and optimization methods for constrained polynomial programming problems," Applied Mathematics and Computation, Elsevier, vol. 262(C), pages 312-325.
    5. 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.
    6. Baringo, Luis & Boffino, Luigi & Oggioni, Giorgia, 2020. "Robust expansion planning of a distribution system with electric vehicles, storage and renewable units," Applied Energy, Elsevier, vol. 265(C).
    7. Chassein, André & Goerigk, Marc, 2018. "Compromise solutions for robust combinatorial optimization with variable-sized uncertainty," European Journal of Operational Research, Elsevier, vol. 269(2), pages 544-555.
    8. 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.
    9. 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.
    10. 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.
    11. Mehdi Ansari & Juan S. Borrero & Leonardo Lozano, 2023. "Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 83-103, January.
    12. Thai Doan Chuong, 2020. "Semidefinite Program Duals for Separable Polynomial Programs Involving Box Constraints," Journal of Optimization Theory and Applications, Springer, vol. 185(1), pages 289-299, April.
    13. Benati, S. & Conde, E., 2022. "A relative robust approach on expected returns with bounded CVaR for portfolio selection," European Journal of Operational Research, Elsevier, vol. 296(1), pages 332-352.
    14. 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.
    15. 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.
    16. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
    17. Guoyin Li & Alfred Ma & Ting Pong, 2014. "Robust least square semidefinite programming with applications," Computational Optimization and Applications, Springer, vol. 58(2), pages 347-379, June.
    18. Ben-Tal, A. & den Hertog, D. & De Waegenaere, A.M.B. & Melenberg, B. & Rennen, G., 2011. "Robust Solutions of Optimization Problems Affected by Uncertain Probabilities," Other publications TiSEM 4d43dc51-86d9-4804-8563-9, Tilburg University, School of Economics and Management.
    19. Pengyu Qian & Zizhuo Wang & Zaiwen Wen, 2015. "A Composite Risk Measure Framework for Decision Making under Uncertainty," Papers 1501.01126, arXiv.org.
    20. Aharon Ben-Tal & Dimitris Bertsimas & David B. Brown, 2010. "A Soft Robust Model for Optimization Under Ambiguity," Operations Research, INFORMS, vol. 58(4-part-2), pages 1220-1234, August.

    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:jglopt:v:55:y:2013:i:2:p:209-226. 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.