IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v91y2025i4d10.1007_s10898-025-01465-w.html
   My bibliography  Save this article

Conic relaxations for conic minimax convex polynomial programs with extensions and applications

Author

Listed:
  • Thai Doan Chuong

    (Brunel University of London)

  • José Vicente-Pérez

    (University of Alicante)

Abstract

In this paper, we analyze conic minimax convex polynomial optimization problems. Under a suitable regularity condition, an exact conic programming relaxation is established based on a positivity characterization of a max function over a conic convex system. Further, we consider a general conic minimax $$\rho $$ ρ -convex polynomial optimization problem, which is defined by appropriately extending the notion of conic convexity of a vector-valued mapping. For this problem, it is shown that a Karush-Kuhn-Tucker condition at a global minimizer is necessary and sufficient for ensuring an exact relaxation with attainment of the conic programming relaxation. The exact conic programming relaxations are applied to SOS-convex polynomial programs, where appropriate choices of the data allow the associated conic programming relaxation to be reformulated as a semidefinite programming problem. In this way, we can further elaborate the obtained results for other special settings including conic robust SOS-convex polynomial problems and difference of SOS-convex polynomial programs.

Suggested Citation

  • Thai Doan Chuong & José Vicente-Pérez, 2025. "Conic relaxations for conic minimax convex polynomial programs with extensions and applications," Journal of Global Optimization, Springer, vol. 91(4), pages 743-763, April.
    • Handle: RePEc:spr:jglopt:v:91:y:2025:i:4:d:10.1007_s10898-025-01465-w
    DOI: 10.1007/s10898-025-01465-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-025-01465-w
    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/s10898-025-01465-w?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. Vial, Jean-Philippe, 1982. "Strong convexity of sets and functions," Journal of Mathematical Economics, Elsevier, vol. 9(1-2), pages 187-205, January.
    2. VIAL, Jean-Philippe, 1982. "Strong convexity of sets and functions," LIDAM Reprints CORE 475, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Jean-Philippe Vial, 1983. "Strong and Weak Convexity of Sets and Functions," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 231-259, May.
    4. Vaithilingam Jeyakumar & Guoyin Li, 2017. "Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs," Journal of Optimization Theory and Applications, Springer, vol. 172(1), pages 156-178, January.
    5. VIAL, Jean-Philippe, 1983. "Strong and weak convexity of sets and functions," LIDAM Reprints CORE 529, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    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. 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.
    9. 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.
    10. V. Jeyakumar, 2008. "Constraint Qualifications Characterizing Lagrangian Duality in Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 136(1), pages 31-41, January.
    Full references (including those not matched with items on IDEAS)

    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. D. H. Yuan & X. L. Liu & A. Chinchuluun & P. M. Pardalos, 2006. "Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 185-199, April.
    2. A. Kabgani & F. Lara, 2022. "Strong subdifferentials: theory and applications in nonconvex optimization," Journal of Global Optimization, Springer, vol. 84(2), pages 349-368, October.
    3. Hugo Leiva & Nelson Merentes & Kazimierz Nikodem & José Sánchez, 2013. "Strongly convex set-valued maps," Journal of Global Optimization, Springer, vol. 57(3), pages 695-705, November.
    4. F. Lara, 2022. "On Strongly Quasiconvex Functions: Existence Results and Proximal Point Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 891-911, March.
    5. Sorin-Mihai Grad & Felipe Lara, 2022. "An extension of the proximal point algorithm beyond convexity," Journal of Global Optimization, Springer, vol. 82(2), pages 313-329, February.
    6. A. Iusem & F. Lara, 2022. "Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 443-461, June.
    7. Jen-Chwan Liu & Chun-Yu Liu, 2013. "Optimality and Duality for Multiobjective Fractional Programming Involving Nonsmooth Generalized -Univex Functions," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2013, pages 1-10, November.
    8. S. Nobakhtian, 2008. "Generalized (F,ρ)-Convexity and Duality in Nonsmooth Problems of Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 136(1), pages 61-68, January.
    9. Altannar Chinchuluun & Dehui Yuan & Panos Pardalos, 2007. "Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity," Annals of Operations Research, Springer, vol. 154(1), pages 133-147, October.
    10. Sorger, Gerhard, 2004. "Consistent planning under quasi-geometric discounting," Journal of Economic Theory, Elsevier, vol. 118(1), pages 118-129, September.
    11. Huynh Ngai & Nguyen Huu Tron & Nguyen Vu & Michel Théra, 2022. "Variational Analysis of Paraconvex Multifunctions," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 180-218, June.
    12. J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.
    13. T. R. Gulati & I. Ahmad & D. Agarwal, 2007. "Sufficiency and Duality in Multiobjective Programming under Generalized Type I Functions," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 411-427, December.
    14. S. Nobakhtian, 2006. "Sufficiency in Nonsmooth Multiobjective Programming Involving Generalized (Fρ)-convexity," Journal of Optimization Theory and Applications, Springer, vol. 130(2), pages 361-367, August.
    15. Sorger, Gerhard, 1995. "On the sensitivity of optimal growth paths," Journal of Mathematical Economics, Elsevier, vol. 24(4), pages 353-369.
    16. 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.
    17. Sedi Bartz & Minh N. Dao & Hung M. Phan, 2022. "Conical averagedness and convergence analysis of fixed point algorithms," Journal of Global Optimization, Springer, vol. 82(2), pages 351-373, February.
    18. Z. Y. Wu & A. M. Rubinov, 2010. "Global Optimality Conditions for Some Classes of Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 145(1), pages 164-185, April.
    19. 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.
    20. Venditti, Alain, 1997. "Strong Concavity Properties of Indirect Utility Functions in Multisector Optimal Growth Models," Journal of Economic Theory, Elsevier, vol. 74(2), pages 349-367, June.

    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:91:y:2025:i:4:d:10.1007_s10898-025-01465-w. 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.