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.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.