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

DOI10.1137/0805032MaRDI QIDQ4852585zbMATH OpenOpenAlexFDO

Authors 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

chain rulequasiconvex functionssubdifferentialTaylor's formula

Mathematics Subject Classification ID

Implicit function theorems, Jacobians, transformations with several variables (26B10) Convexity of real functions of several variables, generalizations (26B25) Nonsmooth analysis (49J52)

Recommendations

• \(C^{k,1}\) functions, characterization, Taylor's formula and optimization: a survey
• Positive definiteness of high-order subdifferential and high-order optimality conditions in vector optimization problems
• A characterization of \(C^{k,1}\) functions.
• scientific article; zbMATH DE number 783544
• \(C^{1,1}\) functions and optimality conditions

Cited in

(18)

• Optimality conditions for \(C^{1,1}\) constrained multiobjective problems
• Three explicit formulas for the Taylor coefficients of the function \(({{1-z} \over {1-xz}} )^ \lambda\)
• 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
• An asymptotic formula for the Taylor coefficients of the function (s)
• Unilateral generalized Hessians and generalized Taylor's expansions
• Conic positive definiteness and sharp minima of fractional orders in vector optimization problems
• scientific article; zbMATH DE number 783544 (Why is no real title available?)
• Second-order efficiency conditions for \(C^{1,1}\)-vector equilibrium problems in terms of contingent derivatives and applications
• \(C^{k,1}\) functions, characterization, Taylor's formula and optimization: a survey
• Optimality conditions for \(C^{1,1}\) vector optimization problems
• A characterization of \(C^{k,1}\) functions.
• Second-order optimality conditions for efficiency in \(C^1\)-smooth robustly quasiconvex multiobjective programming problems
• Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data
• Taylor's expansion for \(C^{1,1}\) functions in Asplund spaces
• From scalar to vector optimization.

This page was built for publication: Taylor’s Formula for $C^{k,1} $ Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852585)