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

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 a...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational optimization and applications Ročník 89; číslo 3; s. 729 - 767
Hlavní autori:	Rashidi, Mehri, Soleimani-damaneh, Majid
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.12.2024
Predmet:	Convex and Discrete Geometry Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Statistics Gradient Sampling (GS) Nonconvex optimization 49J52 Multiobjective programming 90C29 Nonsmooth optimization 90C26 Exact penalization Sequential Quadratic Programming (SQP) Constrained optimization
ISSN:	0926-6003, 1573-2894
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!