.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Multiple objective programming
Pareto optimality
Projected subgradient method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Mycochemical composition, bioactivities, and phylogenetic placement of three wild edible Russula species from Northern Odisha, India三个野生食用Russula种在印度北部奥里萨邦的真菌化学组成、生物活性及系统发育位置
PREAI
分享收藏Acute Effects of Transdermal Administration of Jojoba Oil on Lipid Metabolism in Mice.png)
Medicina
OAAI
MedicinaIF0
OAAI分享收藏
分享收藏The self regulation problem as an inexact steepest descent method for multicriteria optimizationOAAI
OAAI分享收藏
查看更多内容