首页 | 本学科首页   官方微博 | 高级检索  
     

ON CONE D.C. OPTIMIZATION AND CONJUGATE DUALITY
引用本文:M. SEMU. ON CONE D.C. OPTIMIZATION AND CONJUGATE DUALITY[J]. 数学年刊B辑(英文版), 2003, 24(4): 521-528
作者姓名:M. SEMU
作者单位:Institut fut
摘    要:This paper derives first order necessary and sufficient conditions for unconstrained cone d.c. programming problems where the underlined space is partially ordered with respect to a cone. These conditions are given in terms of directional derivatives and subdifferentials of the component functions. Moreover, conjugate duality for cone d.c. optimization is discussed and weak duality theorem is proved in a more general partially ordered linear topological vector space (generalizing the results in [11]).

关 键 词:锥d.c.最优化  共轭对偶  弱对偶定理  次梯度  多目标优化  方向导数
收稿时间:2003-12-01

ON CONE D.C. OPTIMIZATION AND CONJUGATE DUALITY
M. SEMU. ON CONE D.C. OPTIMIZATION AND CONJUGATE DUALITY[J]. Chinese Annals of Mathematics,Series B, 2003, 24(4): 521-528
Authors:M. SEMU
Affiliation:Institut fur Statistik und Mathematische Wirtschaftstheorie, Universitat Karlsruhe, 76128 Karlsruhe,Germany
Abstract:This paper derives first order necessary and sufficient conditions for unconstrained cone d.c. programming problems where the underlined space is partially ordered with respect to a cone. These conditions are given in terms of directional derivatives and subdifferentials of the component functions. Moreover, conjugate duality for cone d.c. optimization is discussed and weak duality theorem is proved in a more general partially ordered linear topological vector space (generalizing the results in [11]).
Keywords:Multi objective optimization   Cone d.c. programming   Optimality conditions   Conjugate duality
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《数学年刊B辑(英文版)》浏览原始摘要信息
点击此处可从《数学年刊B辑(英文版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号