IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v89y2024i3d10.1007_s10589-024-00608-1.html
   My bibliography  Save this article

MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization

Author

Listed:
  • Mehri Rashidi

    (Amirkabir University of Technology)

  • Majid Soleimani-damaneh

    (University of Tehran)

Abstract

In this paper, we propose a method for solving constrained nonsmooth multiobjective optimization problems which is based on a Sequential Quadratic Programming (SQP) type approach and the Gradient Sampling (GS) technique. We consider the multiobjective problems with noncovex and nonsmooth objective and constraint functions. The problem functions are assumed to be locally Lipschitz. Such problems arise in important applications, many having (weak) Pareto solutions at points of nondifferentiability of the problem functions. In our algorithm, a penalty function is applied to regularize the constraints, GS is employed to overcome the subdifferential calculation burden and make the search direction computation effective in nonsmooth regions, and SQP is used for getting a local linearization. We prove the global convergence properties of our algorithm to the stationary points which approximate (weak) Pareto front. Furthermore, we illustrate the ability and efficiency of the proposed method via a MATLAB implementation on several tests problems and compare it with some existing algorithms.

Suggested Citation

  • Mehri Rashidi & Majid Soleimani-damaneh, 2024. "MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization," Computational Optimization and Applications, Springer, vol. 89(3), pages 729-767, December.
    • Handle: RePEc:spr:coopap:v:89:y:2024:i:3:d:10.1007_s10589-024-00608-1
    DOI: 10.1007/s10589-024-00608-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-024-00608-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/s10589-024-00608-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. 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.
    2. Jean-Pierre Aubin, 1984. "Lipschitz Behavior of Solutions to Convex Minimization Problems," Mathematics of Operations Research, INFORMS, vol. 9(1), pages 87-111, February.
    3. Neculai Andrei, 2022. "Modern Numerical Nonlinear Optimization," Springer Optimization and Its Applications, Springer, number 978-3-031-08720-2, December.
    4. Matthias Ehrgott, 2005. "Multicriteria Optimization," Springer Books, Springer, edition 0, number 978-3-540-27659-3, March.
    5. Javad Koushki & Kaisa Miettinen & Majid Soleimani-damaneh, 2022. "LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions," Journal of Global Optimization, Springer, vol. 83(4), pages 843-863, August.
    6. Jörg Fliege & Benar Fux Svaiter, 2000. "Steepest descent methods for multicriteria optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 51(3), pages 479-494, August.
    7. Morovati, Vahid & Pourkarimi, Latif, 2019. "Extension of Zoutendijk method for solving constrained multiobjective optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 44-57.
    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. 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. 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.
    3. Jiawei Chen & Yu-Hong Dai, 2023. "Multiobjective optimization with least constraint violation: optimality conditions and exact penalization," Journal of Global Optimization, Springer, vol. 87(2), pages 807-830, November.
    4. Yong Zhao & Wang Chen & Xinmin Yang, 2024. "Adaptive Sampling Stochastic Multigradient Algorithm for Stochastic Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 215-241, January.
    5. Andrea Cristofari & Marianna Santis & Stefano Lucidi, 2024. "On Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 203(1), pages 126-145, October.
    6. Chen, Jian & Tang, Liping & Yang, Xinmin, 2023. "A Barzilai-Borwein descent method for multiobjective optimization problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 196-209.
    7. Qing-Rui He & Sheng-Jie Li & Bo-Ya Zhang & Chun-Rong Chen, 2024. "A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization," Computational Optimization and Applications, Springer, vol. 89(3), pages 805-842, December.
    8. Yichen Lu & Chao Yang & Jun Yang, 2022. "A multi-objective humanitarian pickup and delivery vehicle routing problem with drones," Annals of Operations Research, Springer, vol. 319(1), pages 291-353, December.
    9. Bogdana Stanojević & Milan Stanojević & Sorin Nădăban, 2021. "Reinstatement of the Extension Principle in Approaching Mathematical Programming with Fuzzy Numbers," Mathematics, MDPI, vol. 9(11), pages 1-16, June.
    10. Stelios Rozakis & Athanasios Kampas, 2022. "An interactive multi-criteria approach to admit new members in international environmental agreements," Operational Research, Springer, vol. 22(4), pages 3461-3487, September.
    11. Chambers, Robert G., 2024. "Numeraire choice, shadow profit, and inefficiency measurement," European Journal of Operational Research, Elsevier, vol. 319(2), pages 658-668.
    12. 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.
    13. Miglierina, E. & Molho, E. & Recchioni, M.C., 2008. "Box-constrained multi-objective optimization: A gradient-like method without "a priori" scalarization," European Journal of Operational Research, Elsevier, vol. 188(3), pages 662-682, August.
    14. Fatemeh Ghandi & Mostafa Davtalab-Olyaie & Masoud Asgharian, 2024. "Peer-evaluation in centrally managed systems," Annals of Operations Research, Springer, vol. 333(1), pages 439-459, February.
    15. Fernando García-Castaño & Miguel Ángel Melguizo-Padial & G. Parzanese, 2023. "Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 367-382, June.
    16. Min Feng & Shengjie Li & Jie Wang, 2022. "On Tucker-Type Alternative Theorems and Necessary Optimality Conditions for Nonsmooth Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 480-503, November.
    17. Erik Alex Papa Quiroz & Nancy Baygorrea Cusihuallpa & Nelson Maculan, 2020. "Inexact Proximal Point Methods for Multiobjective Quasiconvex Minimization on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 879-898, September.
    18. Kely D. V. Villacorta & Paulo R. Oliveira & Antoine Soubeyran, 2014. "A Trust-Region Method for Unconstrained Multiobjective Problems with Applications in Satisficing Processes," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 865-889, March.
    19. Ina Lammel & Karl-Heinz Küfer & Philipp Süss, 2025. "Efficient Approximation Quality Computation for Sandwiching Algorithms for Convex Multicriteria Optimization," Journal of Optimization Theory and Applications, Springer, vol. 204(3), pages 1-21, March.
    20. Abdelaziz, Fouad Ben & Maddah, Bacel & Flamand, Tülay & Azar, Jimmy, 2024. "Store-Wide space planning balancing impulse and convenience," European Journal of Operational Research, Elsevier, vol. 312(1), pages 211-226.

    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:coopap:v:89:y:2024:i:3:d:10.1007_s10589-024-00608-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.