.png){kind=icon}
.png){kind=icon}
Return
Memory gradient method for multiobjective optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2022.127791.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a new descent method, called multiobjective memory gradi-ent method, for finding Pareto critical points of a multiobjective optimization problem. The main thought in this method is to select a combination of the current descent direc-tion and past multi-step iterative information as a new search direction and to obtain a stepsize by two types of strategies. It is proved that the developed direction with suit-able parameters always satisfies the sufficient descent condition at each iteration. Based on mild assumptions, we obtain the global convergence and the rates of convergence for our method. Computational experiments are given to demonstrate the effectiveness of the proposed method. (c) 2022 Elsevier Inc. All rights reserved.
Keywords:
Multiobjective optimization
Memory gradient method
Descent direction
Pareto critical
Convergence analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
View more organizations