节点文献
非锥凸最优化问题中的可行距离
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;
【Key words】 non-conic convex optimization; feasible distance; tractable optimization formulations;
【基金】 国家自然科学基金资助项目(10771057)
- 【文献出处】 湖南大学学报(自然科学版) ,Journal of Hunan University(Natural Sciences) , 编辑部邮箱 ,2009年07期
- 【分类号】O224
- 【被引频次】1
- 【下载频次】62