.png){kind=icon}
Return
A relaxed projection method for solving multiobjective optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2016.05.026.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose an algorithm for solving multiobjective minimization problems on nonempty closed convex subsets of the Euclidean space. The proposed method combines a reflection technique for obtaining a feasible point with a projected subgradient method. Under suitable assumptions, we show that the sequence generated using this method converges to a Pareto optimal point of the problem. We also present some numerical results. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Multiple objective programming
Pareto optimality
Projected subgradient method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
ShareSaveShareSaveAcute Effects of Transdermal Administration of Jojoba Oil on Lipid Metabolism in Mice.png)
Medicina
OAAI
MedicinaIF0
OAAIShareSave
ShareSaveShareSaveShareSaveThe self regulation problem as an inexact steepest descent method for multicriteria optimizationOAAI
OAAIShareSave
View more