OPTIMIZATION AND DUALITY OF CONE-D.C. PROGRAMMING

Citation:

Yin Zhiwen,Li Yuanxi.OPTIMIZATION AND DUALITY OF CONE-D.C. PROGRAMMING[J].Chinese Annals of Mathematics B,1995,16(4):501~510
Page view: 1139        Net amount: 889

Authors:

Yin Zhiwen; Li Yuanxi
Abstract: This paper gives the definitions and some properties of $\varepsilon$-directional derivate and $\varepsilon$-subgrad-\newline ients of cone-convex function. From them, the optimality conditions of local and global optimal point of unconstrained cone-d.c. programming are gained. At last, the duality theorems of this programming are presented.

Keywords:

$\varepsilon$-directional derivate,$\varepsilon$-subgradient, Cone-d.c. function,Optimality condition, Duality theorem.

Classification:

49K30
Download PDF Full-Text

主管单位:国家教育部 主办单位:复旦大学 地址:220 Handan Road, Fudan University, Shanghai, China E-mail:edcam@fudan.edu.cn

本系统由北京勤云科技发展有限公司提供技术支持