Duality Results of Nonlinear Symmetric Cone Programming

被引：0
|
作者：
Jiang, Xiaoqin [1 ]
机构：
[1] Wuhan Yangtze Business Univ, Dept Publ Basic, Wuhan 430065, Peoples R China
来源：
COMPUTATIONAL INTELLIGENCE AND INTELLIGENT SYSTEMS | 2012年 / 316卷
关键词：
Nonlinear symmetric cone programming; weak duality theorem; strong duality; saddle point theorem; EUCLIDEAN JORDAN ALGEBRAS; INTERIOR-POINT ALGORITHMS; COMPLEMENTARITY-PROBLEMS; SMOOTHING ALGORITHM; CONVERGENCE; EXTENSION;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
There recently has been much interest in studying some optimization problems over symmetric cones. In this paper, we discuss the Lagrange dual theory of tonlinear symmetric cone programming, including the weak duality theorem, the strong duality theorem, and the saddle point theorem.
引用
收藏
页码：498 / 502
页数：5
相关论文
共 50 条
12345