Solving nonsmooth interval optimization problems based on interval-valued symmetric invexity
Solving nonsmooth interval optimization problems based on interval-valued symmetric invexity
复制标题
DOI:
10.1016/j.chaos.2023.113834
复制
发表时间:
2023-09
期刊:
影响因子:
--
通讯作者:
Yating Guo;G. Ye;Wei Liu;Dafang Zhao;S. Treanțǎ
中科院分区:
文献类型:
--
作者:
Yating Guo;G. Ye;Wei Liu;Dafang Zhao;S. Treanțǎ
This paper focuses on a nonsmooth nonconvex interval-valued optimization problem. For this, we propose interval-valued symmetric invexity, interval-valued symmetric pseudo-invexity and interval-valued symmetric quasi-invexity in terms of the symmetric gH-differentiable interval-valued functions. Some important properties of these generalized convexities are also discussed. By utilizing these new concepts, we establish sufficient Karush–Kuhn–Tucker conditions for the considered problem. Further, the Wolfe and Mond–Weir type dual problems are associated and weak, strong and strict converse duality results have been derived. Finally, we apply the developed theory to a binary classification problem of interval data by support vector machine.