SUBGRADIENT ALGORITHM FOR SOLVING CONSTRAINED MULTIOBJECTIVE OPTIMIZATION PROBLEMS IN HILBERT SPACES

被引：0
|
作者：
Wang, W. E. N. T. I. N. G. [1 ]
An, A. I. M. I. N. [1 ]
机构：
[1] Lanzhou Univ Technol, Sch Elect Engn & Informat Engn, Lanzhou, Peoples R China
来源：
JOURNAL OF NONLINEAR AND CONVEX ANALYSIS | 2023年 / 24卷 / 05期
关键词：
Pareto solution; multiobjective optimization; subgradient method; CONVERGENCE; NONSMOOTH;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we introduce a subgradient algorithm for solving the constrained multiobjective minimization problem in Hilbert spaces. Under some certain assumptions, we prove that the algorithm converges weakly to a Pareto optimal solution of the problem. Some numerical examples are presented to illustrate the convergence of the proposed algorithm.
引用
收藏
页码：991 / 1003
页数：13
相关论文
共 50 条
12345