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

Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints

Author

Listed:
  • Yarui Duan

    (Soochow University)

  • Liguo Jiao

    (Northeast Normal University)

  • Pengcheng Wu

    (Soochow University)

  • Yuying Zhou

    (Soochow University)

Abstract

This paper deals with a vector polynomial optimization problem over a basic closed semi-algebraic set. By invoking some powerful tools from real semi-algebraic geometry, we first introduce the concept called tangency varieties; obtain the relationships of the Palais–Smale condition, Cerami condition, M-tameness, and properness related to the considered problem, in which the condition of Mangasarian–Fromovitz constraint qualification at infinity plays an essential role in deriving these relationships. At last, according to the obtained connections, we establish the existence of Pareto solutions to the problem in consideration and give some examples to illustrate our main findings.

Suggested Citation

  • Yarui Duan & Liguo Jiao & Pengcheng Wu & Yuying Zhou, 2022. "Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints," Journal of Optimization Theory and Applications, Springer, vol. 195(1), pages 148-171, October.
    • Handle: RePEc:spr:joptap:v:195:y:2022:i:1:d:10.1007_s10957-022-02068-1
    DOI: 10.1007/s10957-022-02068-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-022-02068-1
    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-02068-1?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. S. Deng, 1998. "On Efficient Solutions in Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 96(1), pages 201-209, January.
    2. X. X. Huang & X. Q. Yang & K. L. Teo, 2004. "Characterizing Nonemptiness and Compactness of the Solution Set of a Convex Vector Optimization Problem with Cone Constraints and Applications," Journal of Optimization Theory and Applications, Springer, vol. 123(2), pages 391-407, November.
    3. Jonathan M. Borwein, 1983. "On the Existence of Pareto Efficient Points," Mathematics of Operations Research, INFORMS, vol. 8(1), pages 64-73, February.
    4. Victor Blanco & Justo Puerto & Safae El Haj Ben Ali, 2014. "A Semidefinite Programming approach for solving Multiobjective Linear Programming," Journal of Global Optimization, Springer, vol. 58(3), pages 465-480, March.
    5. César Gutiérrez & Rubén López & Vicente Novo, 2014. "Existence and Boundedness of Solutions in Infinite-Dimensional Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 515-547, August.
    6. Jae Hyoung Lee & Nithirat Sisarat & Liguo Jiao, 2021. "Multi-objective convex polynomial optimization and semidefinite programming relaxations," Journal of Global Optimization, Springer, vol. 80(1), pages 117-138, May.
    7. S. Deng, 1998. "Characterizations of the Nonemptiness and Compactness of Solution Sets in Convex Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 96(1), pages 123-131, January.
    8. S. Deng, 2010. "Boundedness and Nonemptiness of the Efficient Solution Sets in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 144(1), pages 29-42, January.
    9. Gábor Pataki, 2007. "On the Closedness of the Linear Image of a Closed Convex Cone," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 395-412, May.
    10. Jae Hyoung Lee & Liguo Jiao, 2018. "Solving Fractional Multicriteria Optimization Problems with Sum of Squares Convex Polynomial Data," Journal of Optimization Theory and Applications, Springer, vol. 176(2), pages 428-455, February.
    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. César Gutiérrez & Rubén López & Vicente Novo, 2014. "Existence and Boundedness of Solutions in Infinite-Dimensional Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 515-547, August.
    2. César Gutiérrez & Rubén López, 2020. "On the Existence of Weak Efficient Solutions of Nonconvex Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 185(3), pages 880-902, June.
    3. Feng Guo & Liguo Jiao, 2023. "A new scheme for approximating the weakly efficient solution set of vector rational optimization problems," Journal of Global Optimization, Springer, vol. 86(4), pages 905-930, August.
    4. S. Deng, 2010. "Boundedness and Nonemptiness of the Efficient Solution Sets in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 144(1), pages 29-42, January.
    5. Jae Hyoung Lee & Nithirat Sisarat & Liguo Jiao, 2021. "Multi-objective convex polynomial optimization and semidefinite programming relaxations," Journal of Global Optimization, Springer, vol. 80(1), pages 117-138, May.
    6. Li-Wen Zhou & Nan-Jing Huang, 2013. "Existence of Solutions for Vector Optimization on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 157(1), pages 44-53, April.
    7. X. Huang & J. Yao, 2013. "Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems," Journal of Global Optimization, Springer, vol. 55(3), pages 611-626, March.
    8. S. Deng, 2009. "Characterizations of the Nonemptiness and Boundedness of Weakly Efficient Solution Sets of Convex Vector Optimization Problems in Real Reflexive Banach Spaces," Journal of Optimization Theory and Applications, Springer, vol. 140(1), pages 1-7, January.
    9. S. Deng, 1998. "On Efficient Solutions in Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 96(1), pages 201-209, January.
    10. Nergiz Kasimbeyli, 2015. "Existence and characterization theorems in nonconvex vector optimization," Journal of Global Optimization, Springer, vol. 62(1), pages 155-165, May.
    11. Thai Doan Chuong, 2021. "Optimality and duality in nonsmooth composite vector optimization and applications," Annals of Operations Research, Springer, vol. 296(1), pages 755-777, January.
    12. H. Luo & X. Huang & J. Peng, 2012. "Generalized weak sharp minima in cone-constrained convex optimization with applications," Computational Optimization and Applications, Springer, vol. 53(3), pages 807-821, December.
    13. Jeyakumar, V. & Lee, G.M. & Dinh, N., 2006. "Characterizations of solution sets of convex vector minimization problems," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1380-1395, November.
    14. Botte, Marco & Schöbel, Anita, 2019. "Dominance for multi-objective robust optimization concepts," European Journal of Operational Research, Elsevier, vol. 273(2), pages 430-440.
    15. Jayswal, Anurag & Singh, Shipra & Kurdi, Alia, 2016. "Multitime multiobjective variational problems and vector variational-like inequalities," European Journal of Operational Research, Elsevier, vol. 254(3), pages 739-745.
    16. M. Chicco & F. Mignanego & L. Pusillo & S. Tijs, 2011. "Vector Optimization Problems via Improvement Sets," Journal of Optimization Theory and Applications, Springer, vol. 150(3), pages 516-529, September.
    17. LA TORRE Davide & CUSANO Claudio & FINI Matteo, 2004. "Characterizations of convex vector functions and optimization," Departmental Working Papers 2004-05, Department of Economics, Management and Quantitative Methods at Università degli Studi di Milano.
    18. Harold Benson, 2012. "An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem," Journal of Global Optimization, Springer, vol. 52(3), pages 553-574, March.
    19. V. Jeyakumar & G. M. Lee & N. Dinh, 2004. "Lagrange Multiplier Conditions Characterizing the Optimal Solution Sets of Cone-Constrained Convex Programs," Journal of Optimization Theory and Applications, Springer, vol. 123(1), pages 83-103, October.
    20. Nicolas Hadjisavvas & Felipe Lara & Juan Enrique Martínez-Legaz, 2019. "A Quasiconvex Asymptotic Function with Applications in Optimization," Journal of Optimization Theory and Applications, Springer, vol. 180(1), pages 170-186, January.

    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:195:y:2022:i:1:d:10.1007_s10957-022-02068-1. 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.