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

Mehri Rashidi and Majid Soleimani-damaneh ()
Additional contact information
Mehri Rashidi: Amirkabir University of Technology
Majid Soleimani-damaneh: University of Tehran

Computational Optimization and Applications, 2024, vol. 89, issue 3, No 6, 729-767

Abstract: 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.

Keywords: Multiobjective programming; Nonconvex optimization; Nonsmooth optimization; Constrained optimization; Sequential Quadratic Programming (SQP); Gradient Sampling (GS); Exact penalization; 90C29; 90C26; 49J52 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-024-00608-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:89:y:2024:i:3:d:10.1007_s10589-024-00608-1

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-024-00608-1

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().