Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis

Optimization ◽  
2020 ◽  
pp. 1-29
Author(s):  
Y. D. Xu ◽  
P. P. Zhang ◽  
S. K. Zhu
2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Xiaoqing Ou ◽  
Suliman Al-Homidan ◽  
Qamrul Hasan Ansari ◽  
Jiawei Chen

<p style='text-indent:20px;'>We introduce the <inline-formula><tex-math id="M1">\begin{document}$ \mathcal{C} $\end{document}</tex-math></inline-formula>-robust efficient solution and optimistic <inline-formula><tex-math id="M2">\begin{document}$ \mathcal{C} $\end{document}</tex-math></inline-formula>-robust efficient solution of uncertain multiobjective optimization problems (UMOP). By using image space analysis, robust optimality conditions as well as saddle point sufficient optimality conditions for uncertain multiobjective optimization problems are established based on real-valued linear (regular) weak separation function and real-valued (vector-valued) nonlinear (regular) weak separation functions. We also introduce two inclusion problems by using the image sets of robust counterpart of (UMOP) and establish the relations between the solution of the inclusion problems and the <inline-formula><tex-math id="M3">\begin{document}$ \mathcal{C} $\end{document}</tex-math></inline-formula>-robust efficient solution (respectively, optimistic <inline-formula><tex-math id="M4">\begin{document}$ \mathcal{C} $\end{document}</tex-math></inline-formula>-robust efficient solution) of (UMOP).</p>


Author(s):  
Jutamas Kerdkaew ◽  
Rabian Wangkeeree ◽  
Rattanaporn Wangkeereee

AbstractIn this paper, we investigate an uncertain multiobjective optimization problem involving nonsmooth and nonconvex functions. The notion of a (local/global) robust weak sharp efficient solution is introduced. Then, we establish necessary and sufficient optimality conditions for local and/or the robust weak sharp efficient solutions of the considered problem. These optimality conditions are presented in terms of multipliers and Mordukhovich/limiting subdifferentials of the related functions.


2022 ◽  
Vol 0 (0) ◽  
Author(s):  
Fouzia Amir ◽  
Ali Farajzadeh ◽  
Jehad Alzabut

Abstract Multiobjective optimization is the optimization with several conflicting objective functions. However, it is generally tough to find an optimal solution that satisfies all objectives from a mathematical frame of reference. The main objective of this article is to present an improved proximal method involving quasi-distance for constrained multiobjective optimization problems under the locally Lipschitz condition of the cost function. An instigation to study the proximal method with quasi distances is due to its widespread applications of the quasi distances in computer theory. To study the convergence result, Fritz John’s necessary optimality condition for weak Pareto solution is used. The suitable conditions to guarantee that the cluster points of the generated sequences are Pareto–Clarke critical points are provided.


Sign in / Sign up

Export Citation Format

Share Document