An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem

Uložené v:
Podrobná bibliografia
Názov: An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
Autori: Fouzia Amir, Ali Farajzadeh, Jehad Alzabut
Zdroj: Journal of Applied Analysis. 28:333-340
Informácie o vydavateľovi: Walter de Gruyter GmbH, 2022.
Rok vydania: 2022
Predmety: 0211 other engineering and technologies, 02 engineering and technology
Popis: Multiobjective optimization is the optimization with several conflicting objective functions. However, it is generally tough to find an optimal solution that satisfies all objectives from a mathematical frame of reference. The main objective of this article is to present an improved proximal method involving quasi-distance for constrained multiobjective optimization problems under the locally Lipschitz condition of the cost function. An instigation to study the proximal method with quasi distances is due to its widespread applications of the quasi distances in computer theory. To study the convergence result, Fritz John’s necessary optimality condition for weak Pareto solution is used. The suitable conditions to guarantee that the cluster points of the generated sequences are Pareto–Clarke critical points are provided.
Druh dokumentu: Article
Jazyk: English
ISSN: 1869-6082
1425-6908
DOI: 10.1515/jaa-2021-2074
Prístupové číslo: edsair.doi...........e524368b6535f40b15f5d99d4699a28c
Databáza: OpenAIRE
Popis
Abstrakt:Multiobjective optimization is the optimization with several conflicting objective functions. However, it is generally tough to find an optimal solution that satisfies all objectives from a mathematical frame of reference. The main objective of this article is to present an improved proximal method involving quasi-distance for constrained multiobjective optimization problems under the locally Lipschitz condition of the cost function. An instigation to study the proximal method with quasi distances is due to its widespread applications of the quasi distances in computer theory. To study the convergence result, Fritz John’s necessary optimality condition for weak Pareto solution is used. The suitable conditions to guarantee that the cluster points of the generated sequences are Pareto–Clarke critical points are provided.
ISSN:18696082
14256908
DOI:10.1515/jaa-2021-2074