Optimality conditions for nonconvex mathematical programming problems using weak subdifferentials and augmented normal cones
Applied Set-Valued Analysis and Optimization · 2024
In this paper, we study some characterizations of the class of weakly subdifferentiable functions and formulate optimality conditions for nonconvex mathematical programming problems described by the class of weakly subdifferentiable functions in real normed spaces.The necessary and sufficient optimality conditions for a nonconvex scalar function with a global minimum/or a global maximum at a given vector via the weak subdifferentials and augmented normal cones are established.Additionally, the necessary and sufficient optimality conditions for a nonconvex vector function with a weakly efficient solution/or an efficient solution at a given vector via the augmented weak subdifferentials and normal cones are presented too.Finally, our optimality conditions are used to derive the necessary optimality conditions for nonsmooth nonconvex mathematical programming problems with set, inequality, and equality constraints.