返回
An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
DOI:10.1007/s10479-020-03808-0.png)
摘要
En 中文
For a class of nonsmooth nonconvex multiobjective problems, we develop an inexact multiple proximal bundle method. In our approach instead of scalarization, we find descent direction for every objective function separately by utilizing the inexact proximal bundle method. Then we attempt to find a common descent direction for all objective functions. We study the effect of the inexactness of the objective and subgradient values on the new proposed method and obtain the reasonable convergence properties. We further consider a class of difficult nonsmooth nonconvex problems, made even more difficult by inserting the inexactness in the available information. At the end, to demonstrate the efficiency of the proposed algorithm, some encouraging numerical experiments are provided.
Keyword:
Multiobjective optimization
Proximal bundle method
Inexact information
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
Mycochemical composition, bioactivities, and phylogenetic placement of three wild edible Russula species from Northern Odisha, India三个野生食用Russula种在印度北部奥里萨邦的真菌化学组成、生物活性及系统发育位置
Genomic Profiling of Circulating Tumor DNA From Cerebrospinal Fluid to Guide Clinical Decision Making for Patients With Primary and Metastatic Brain Tumors脑脊液中循环肿瘤DNA的基因组分析,以指导原发性和转移性脑肿瘤患者的临床决策
Experimental and numerical investigation on low‐velocity impact response of sandwich structure with functionally graded core关于功能梯度芯层 sandwich 结构低速冲击响应的实验与数值研究
A proximal bundle method for nonsmooth nonconvex functions with inexact information具有不精确信息的非光滑非凸函数的近端束方法

