Optimization and duality of cone-d.c. programming

MaRDI QIDQ1905713zbMATH OpenFDO

Authors Zhiwen Yin, Yuanxi Li

Publication date 25 November 1996

Published in Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

zbMATH Keywords

generalizations of directional derivativesoptimality conditionssubdifferentials of vector-valued functions

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Review text

Using some generalizations of directional derivatives and subdifferentials of vector-valued functions the authors prove optimality conditions for unconstrained vector optimization problems where a so-called cone d.c. function (i.e., that function is the difference of two cone-convex functions) is involved. Moreover, Toland's duality theorem for scalar d.c. problems is proved for the vector-valued case.

Recommendations

• On cone d. c. optimization and conjugate duality
• scientific article; zbMATH DE number 6005913
• Duality for vector optimization of set-valued functions
• scientific article; zbMATH DE number 2100861
• scientific article; zbMATH DE number 2084880

Cited in

(7)

• Concave programming and DH-point
• On cone d. c. optimization and conjugate duality
• Duality for vector optimization of set-valued functions
• RECIPES FOR BUILDING THE DUAL OF CONIC OPTIMIZATION PROBLEM
• scientific article; zbMATH DE number 1942641 (Why is no real title available?)
• scientific article; zbMATH DE number 2100861 (Why is no real title available?)
• Relationships between vector-valued cone-dc and locally cone-dc functions

This page was built for publication: Optimization and duality of cone-d.c. programming

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