IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v96y2022i1d10.1007_s00186-022-00787-9.html
   My bibliography  Save this article

Approximations for Pareto and Proper Pareto solutions and their KKT conditions

Author

Listed:
  • P. Kesarwani

    (Indian Institute of Technology)

  • P. K. Shukla

    (Alliance Manchester Business School
    Institute AIFB, Karlsruhe Institute of Technology)

  • J. Dutta

    (Indian Institute of Technology)

  • K. Deb

    (Michigan State University)

Abstract

In this article, we view the Pareto and weak Pareto solutions of the multiobjective optimization by using an approximate version of KKT type conditions. In one of our main results Ekeland’s variational principle for vector-valued maps plays a key role. We also focus on an improved version of Geoffrion proper Pareto solutions and it’s approximation and characterize them through saddle point and KKT type conditions.

Suggested Citation

  • P. Kesarwani & P. K. Shukla & J. Dutta & K. Deb, 2022. "Approximations for Pareto and Proper Pareto solutions and their KKT conditions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(1), pages 123-148, August.
    • Handle: RePEc:spr:mathme:v:96:y:2022:i:1:d:10.1007_s00186-022-00787-9
    DOI: 10.1007/s00186-022-00787-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-022-00787-9
    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/s00186-022-00787-9?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. Gabriele Eichfelder & Leo Warnow, 2021. "Proximity measures based on KKT points for constrained multi-objective optimization," Journal of Global Optimization, Springer, vol. 80(1), pages 63-86, May.
    2. Joydeep Dutta & Kalyanmoy Deb & Rupesh Tulshyan & Ramnik Arora, 2013. "Approximate KKT points and a proximity measure for termination," Journal of Global Optimization, Springer, vol. 56(4), pages 1463-1499, August.
    3. Hiroki Tanabe & Ellen H. Fukuda & Nobuo Yamashita, 2019. "Proximal gradient methods for multiobjective optimization and their applications," Computational Optimization and Applications, Springer, vol. 72(2), pages 339-361, March.
    4. G. Cocchi & G. Liuzzi & S. Lucidi & M. Sciandrone, 2020. "On the convergence of steepest descent methods for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 77(1), pages 1-27, September.
    5. Giorgio Giorgi & Bienvenido Jiménez & Vicente Novo, 2016. "Approximate Karush–Kuhn–Tucker Condition in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 70-89, October.
    6. Bennet Gebken & Sebastian Peitz, 2021. "An Efficient Descent Method for Locally Lipschitz Multiobjective Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 188(3), pages 696-723, March.
    7. C. Gutiérrez & B. Jiménez & V. Novo, 2006. "On Approximate Efficiency in Multiobjective Programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 165-185, August.
    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. Braun, Marlon & Shukla, Pradyumn, 2024. "On cone-based decompositions of proper Pareto-optimality in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 317(2), pages 592-602.

    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. G. A. Carrizo & N. S. Fazzio & M. D. Sánchez & M. L. Schuverdt, 2024. "Scaled-PAKKT sequential optimality condition for multiobjective problems and its application to an Augmented Lagrangian method," Computational Optimization and Applications, Springer, vol. 89(3), pages 769-803, December.
    2. Min Feng & Shengjie Li, 2018. "An approximate strong KKT condition for multiobjective optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 489-509, October.
    3. C. Gutiérrez & L. Huerga & B. Jiménez & V. Novo, 2020. "Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 526-544, July.
    4. Roberto Andreani & Ellen H. Fukuda & Gabriel Haeser & Daiana O. Santos & Leonardo D. Secchin, 2024. "Optimality Conditions for Nonlinear Second-Order Cone Programming and Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 1-33, January.
    5. Gabriele Eichfelder & Leo Warnow, 2021. "Proximity measures based on KKT points for constrained multi-objective optimization," Journal of Global Optimization, Springer, vol. 80(1), pages 63-86, May.
    6. 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.
    7. Konstantin Sonntag & Bennet Gebken & Georg Müller & Sebastian Peitz & Stefan Volkwein, 2024. "A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 203(1), pages 455-487, October.
    8. Bo Jiang & Tianyi Lin & Shiqian Ma & Shuzhong Zhang, 2019. "Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis," Computational Optimization and Applications, Springer, vol. 72(1), pages 115-157, January.
    9. L. P. Hai & L. Huerga & P. Q. Khanh & V. Novo, 2019. "Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems," Journal of Global Optimization, Springer, vol. 74(2), pages 361-382, June.
    10. G. Cocchi & M. Lapucci, 2020. "An augmented Lagrangian algorithm for multi-objective optimization," Computational Optimization and Applications, Springer, vol. 77(1), pages 29-56, September.
    11. Matteo Lapucci & Pierluigi Mansueto, 2023. "A limited memory Quasi-Newton approach for multi-objective optimization," Computational Optimization and Applications, Springer, vol. 85(1), pages 33-73, May.
    12. Giorgio Giorgi, 2018. "A Guided Tour in Constraint Qualifications for Nonlinear Programming under Differentiability Assumptions," DEM Working Papers Series 160, University of Pavia, Department of Economics and Management.
    13. Alfredo N. Iusem & Jefferson G. Melo & Ray G. Serra, 2021. "A Strongly Convergent Proximal Point Method for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 183-200, July.
    14. Bennet Gebken & Katharina Bieker & Sebastian Peitz, 2023. "On the structure of regularization paths for piecewise differentiable regularization terms," Journal of Global Optimization, Springer, vol. 85(3), pages 709-741, March.
    15. Mohamed Abouhawwash & Kalyanmoy Deb, 2021. "Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics," Journal of Heuristics, Springer, vol. 27(4), pages 575-614, August.
    16. Marius Durea & Radu Strugariu, 2020. "On the sensitivity of Pareto efficiency in set-valued optimization problems," Journal of Global Optimization, Springer, vol. 78(3), pages 581-596, November.
    17. Gutiérrez, C. & Jiménez, B. & Novo, V., 2012. "Improvement sets and vector optimization," European Journal of Operational Research, Elsevier, vol. 223(2), pages 304-311.
    18. C. Gutiérrez & B. Jiménez & V. Novo, 2012. "Equivalent ε-efficiency notions in vector optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(2), pages 437-455, July.
    19. Zachary Feinstein & Birgit Rudloff, 2024. "Deep learning the efficient frontier of convex vector optimization problems," Journal of Global Optimization, Springer, vol. 90(2), pages 429-458, October.
    20. C. Gutiérrez & L. Huerga & V. Novo & C. Tammer, 2016. "Duality related to approximate proper solutions of vector optimization problems," Journal of Global Optimization, Springer, vol. 64(1), pages 117-139, 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:mathme:v:96:y:2022:i:1:d:10.1007_s00186-022-00787-9. 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.