Taylor’s Formula for $C^{k,1} $ Functions

DOI10.1137/0805032zbMath0852.49012MaRDI QIDQ4852585

Dinh The Luc

Publication date: 9 December 1996

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0805032

zbMATH Keywords

Taylor's formula; subdifferential; quasiconvex functions; chain rule

Mathematics Subject Classification ID

49J52: Nonsmooth analysis

26B10: Implicit function theorems, Jacobians, transformations with several variables

26B25: Convexity of real functions of several variables, generalizations

Related Items

Second-order efficiency conditions for $C^{1,1}$-vector equilibrium problems in terms of contingent derivatives and applications, Optimality conditions for \(C^{1,1}\) vector optimization problems, Conic positive definiteness and sharp minima of fractional orders in vector optimization problems, Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data, From scalar to vector optimization., Optimality conditions for \(C^{1,1}\) constrained multiobjective problems, Positive definiteness of high-order subdifferential and high-order optimality conditions in vector optimization problems, Second-order optimality conditions for constrained optimization problems with \(C^1\) data via regular and limiting subdifferentials, Second-order characterizations of quasiconvexity and pseudoconvexity for differentiable functions with Lipschitzian derivatives, Second-order optimality conditions for efficiency in \(C^{1,1}\)-smooth quasiconvex multiobjective programming problem