arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1201.5795math.OC
收藏

关于凸多目标optimization中条件数的一些结果

Some results on condition numbers in convex multiobjective optimization

Monica Bianchi, Enrico Miglierina, Elena Molho, Rita Pini

摘要:

各种条件数的概念被用来研究标量最优化问题的某些灵敏度方面。本文的目的是引入条件数的概念来研究R^n中给定闭球上由m个凸C^1,1目标函数定义的多目标最优化问题的情形.提出了两种办法:第一种方法采用围绕给定解点的局部观点,而第二种方法将解集视为整体。两个概念之间的良好条件的问题的比较。我们强调,在目前的工作中引入的条件数减少到相同的条件数Zolezzi在2003年提出的标量最优化问题的特殊情况下,考虑有。函数之间的伪距离被定义为使得条件数提供了一个上界,该上界关于可以选择离良好条件函数f多远的扰动函数g,以便g也是良好条件的。对于局部和整体方法,证明了经典的Eckart-Young距离定理的推广,即使只考虑一类特殊的扰动。

英文摘要:

Various notions of condition numbers are used to study some sensitivity aspects of scalar optimization problems. The aim of this paper is to introduce a notion of condition number to study the case of a multiobjective optimization problem defined via m convex C^1,1 objective functions on a given closed ball in R^n. Two approaches are proposed: the first one adopts a local point of view around a given solution point, whereas the second one considers the solution set as a whole. A comparison between the two notions of well-conditioned problem is developed. We underline that both the condition numbers introduced in the present work reduce to the same of condition number proposed by Zolezzi in 2003, in the special case of the scalar optimization problem considered there. A pseudodistance between functions is defined such that the condition number provides an upper bound on how far from a well-conditioned function f a perturbed function g can be chosen in order that g is well-conditioned too. For both the local and the global approach an extension of classical Eckart-Young distance theorem is proved, even if only a special class of perturbations is considered.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑