期刊文献+

非锥凸最优化问题中最优目标函数值的界

BOUNDEDNESS OF OPTIMAL FUNCTION VALUE ON NON-CONIC CONVEX OPTIMIZATION PROBLEMS
在线阅读 下载PDF
导出
摘要 在约束为一般闭凸集且原非锥凸规划问题或其对偶可行时,令d扰动,考察新系统中最优目标函数值的变化. In the case that the constraint is a general convex set and the primitive non - convex programming or its dual is feasible, the variation of the optimal objective function value for the new system is investigated when d is perturbated.
作者 林娇燕
出处 《华南师范大学学报(自然科学版)》 CAS 北大核心 2009年第3期25-27,共3页 Journal of South China Normal University(Natural Science Edition)
基金 广东省自然科学基金博士科研启动项目资助(8451063502000019)
关键词 非锥凸最优化 对偶 可行 最优目标函数值的界 non -conic convex optimization duality feasibility boundedness of optimal function value
  • 相关文献

参考文献6

  • 1EPELMAN M, FREUND R M. A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems[ J]. SIAM Journal on Optimization, 2002, 12 : 627 -655.
  • 2FREUND R M, VERA J R. Some characterizations and properties of the distance to ill - posedness and the condition measure of a conic linear system [ J ]. Mathematical Programming, 1999, 86 : 225 - 260.
  • 3PENA J, RENEGAR J. Computing approximate solutions for convex conic systems of constraints [ J ]. Mathematical Programming, 2001, 87 : 35t -383.
  • 4RENEGAR J. Some perturbation theory for hnear programming[J]. Mathematical Prong, 1994, 65:73-91.
  • 5RENEGAR J. Linear programming, complexity theory, and elementary functional analysis [ J ]. Mathematical Programming, 1995, 70 : 279 - 351.
  • 6FREUND R M,ORDONEZ F. On an extension of conditional number theory to noneonic convex optimization[ J ]. Mathematics of Operations Research, 2005, 30: 173- 194.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部