IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v194y2022i2d10.1007_s10957-022-02040-z.html
   My bibliography  Save this article

Conic Linear Programming Duals for Classes of Quadratic Semi-Infinite Programs with Applications

Author

Listed:
  • Cao Thanh Tinh

    (Vietnam National University
    University of Information Technology)

  • Thai Doan Chuong

    (Saigon University
    RMIT University)

Abstract

In this paper, we first present strong conic linear programming duals for convex quadratic semi-infinite problems with linear constraints and geometric index sets. The obtained results show that the optimal values of a convex quadratic semi-infinite problem with convex compact sets and its associated conic linear programming dual problem are equal with the solution attainment of the dual program. We then prove that the conic linear programming dual is equivalently reformulated as a second-order cone programming problem whenever the index sets are ellipsoids, balls, cross-polytopes or boxes. As an application, we show that a class of separable fractional quadratic semi-infinite programs also admits second-order cone programming duality under ellipsoidal index sets.

Suggested Citation

  • Cao Thanh Tinh & Thai Doan Chuong, 2022. "Conic Linear Programming Duals for Classes of Quadratic Semi-Infinite Programs with Applications," Journal of Optimization Theory and Applications, Springer, vol. 194(2), pages 570-596, August.
    • Handle: RePEc:spr:joptap:v:194:y:2022:i:2:d:10.1007_s10957-022-02040-z
    DOI: 10.1007/s10957-022-02040-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-022-02040-z
    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-022-02040-z?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. 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.
    2. Stein, Oliver, 2012. "How to solve a semi-infinite optimization problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 312-320.
    3. Lopez, Marco & Still, Georg, 2007. "Semi-infinite programming," European Journal of Operational Research, Elsevier, vol. 180(2), pages 491-518, July.
    4. T. D. Chuong & V. Jeyakumar & G. Li, 2019. "A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs," Journal of Global Optimization, Springer, vol. 75(4), pages 885-919, December.
    5. 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.
    6. Li Wang & Feng Guo, 2014. "Semidefinite relaxations for semi-infinite polynomial programming," Computational Optimization and Applications, Springer, vol. 58(1), pages 133-159, May.
    7. V. Jeyakumar & J. Vicente-Pérez, 2014. "Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs," Journal of Optimization Theory and Applications, Springer, vol. 162(3), pages 735-753, September.
    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. Xiangkai Sun & Wen Tan & Kok Lay Teo, 2023. "Characterizing a Class of Robust Vector Polynomial Optimization via Sum of Squares Conditions," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 737-764, May.
    2. Thai Doan Chuong & José Vicente-Pérez, 2023. "Conic Relaxations with Stable Exactness Conditions for Parametric Robust Convex Polynomial Problems," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 387-410, 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. Thai Doan Chuong & José Vicente-Pérez, 2023. "Conic Relaxations with Stable Exactness Conditions for Parametric Robust Convex Polynomial Problems," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 387-410, May.
    2. Thai Doan Chuong, 2022. "Second-order cone programming relaxations for a class of multiobjective convex polynomial problems," Annals of Operations Research, Springer, vol. 311(2), pages 1017-1033, April.
    3. Sönke Behrends & Anita Schöbel, 2020. "Generating Valid Linear Inequalities for Nonlinear Programs via Sums of Squares," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 911-935, September.
    4. Ariel Neufeld & Antonis Papapantoleon & Qikun Xiang, 2023. "Model-Free Bounds for Multi-Asset Options Using Option-Implied Information and Their Exact Computation," Management Science, INFORMS, vol. 69(4), pages 2051-2068, April.
    5. Mengwei Xu & Soon-Yi Wu & Jane Ye, 2014. "Solving semi-infinite programs by smoothing projected gradient method," Computational Optimization and Applications, Springer, vol. 59(3), pages 591-616, December.
    6. Peter Kirst & Oliver Stein, 2019. "Global optimization of generalized semi-infinite programs using disjunctive programming," Journal of Global Optimization, Springer, vol. 73(1), pages 1-25, January.
    7. M. A. Goberna & M. A. López, 2018. "Recent contributions to linear semi-infinite optimization: an update," Annals of Operations Research, Springer, vol. 271(1), pages 237-278, December.
    8. Peter Kirst & Oliver Stein, 2016. "Solving Disjunctive Optimization Problems by Generalized Semi-infinite Optimization Techniques," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 1079-1109, June.
    9. Hatim Djelassi & Alexander Mitsos, 2021. "Global Solution of Semi-infinite Programs with Existence Constraints," Journal of Optimization Theory and Applications, Springer, vol. 188(3), pages 863-881, March.
    10. M. A. Goberna & M. A. López, 2017. "Recent contributions to linear semi-infinite optimization," 4OR, Springer, vol. 15(3), pages 221-264, September.
    11. Bo Wei & William B. Haskell & Sixiang Zhao, 2020. "The CoMirror algorithm with random constraint sampling for convex semi-infinite programming," Annals of Operations Research, Springer, vol. 295(2), pages 809-841, December.
    12. Marendet, Antoine & Goldsztejn, Alexandre & Chabert, Gilles & Jermann, Christophe, 2020. "A standard branch-and-bound approach for nonlinear semi-infinite problems," European Journal of Operational Research, Elsevier, vol. 282(2), pages 438-452.
    13. 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.
    14. Li Wang & Feng Guo, 2014. "Semidefinite relaxations for semi-infinite polynomial programming," Computational Optimization and Applications, Springer, vol. 58(1), pages 133-159, May.
    15. S. Mishra & M. Jaiswal & H. Le Thi, 2012. "Nonsmooth semi-infinite programming problem using Limiting subdifferentials," Journal of Global Optimization, Springer, vol. 53(2), pages 285-296, June.
    16. Duarte, Belmiro P.M. & Sagnol, Guillaume & Wong, Weng Kee, 2018. "An algorithm based on semidefinite programming for finding minimax optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 119(C), pages 99-117.
    17. Nazih Abderrazzak Gadhi, 2019. "Necessary optimality conditions for a nonsmooth semi-infinite programming problem," Journal of Global Optimization, Springer, vol. 74(1), pages 161-168, May.
    18. Rafael Correa & Marco A. López & Pedro Pérez-Aros, 2023. "Optimality Conditions in DC-Constrained Mathematical Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1191-1225, September.
    19. Jan Schwientek & Tobias Seidel & Karl-Heinz Küfer, 2021. "A transformation-based discretization method for solving general semi-infinite optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 83-114, February.
    20. Engau, Alexander & Sigler, Devon, 2020. "Pareto solutions in multicriteria optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 357-368.

    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:194:y:2022:i:2:d:10.1007_s10957-022-02040-z. 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.