湖南大学学报（自然科学版）2009，Vol.36Issue(7)：85-88,4.
非锥凸最优化问题中的可行距离
Feasible Distance in Non-conic Convex Optimization Problems
摘要
Abstract
When a non-conic convex optimization problem or its dual was infeasible, we considered the feasibility for the new system by introducing a concept of feasible distance. Moreover, we investigated the properties and obtained the equivalent optimization formulations with tractability for the feasible distance.关键词
非锥凸最优化/可行距离/等价优化形式Key words
non-conic convex optimization/feasible distance/tractable optimization formulations分类
数理科学引用本文复制引用
罗桂美,夏建业..非锥凸最优化问题中的可行距离[J].湖南大学学报（自然科学版）,2009,36(7):85-88,4.基金项目
国家自然科学基金资助项目(10771057) （10771057）
