Positive definiteness of high-order subdifferential and high-order optimality conditions in vector optimization problems (Q1949495): Difference between revisions

Summary: We obtain a new Taylor formula in terms of the \(k + 1\) order subdifferential of a \(C^{k,1}\) function from \(\mathbb{R}^n\) to \(\mathbb{R}^m\). As its applications in optimization problems, we build \(k + 1\) order sufficient optimality conditions of this kind of functions and \(k + 1\) order necessary conditions for strongly \(C\)-quasiconvex functions.