Smoothing by mollifiers. Part I: semi-infinite optimization
Smoothing by mollifiers. Part I: semi-infinite optimization
复制标题
通过软化剂进行平滑处理。
DOI：
--
复制
发表时间：
2008
影响因子：
1.8
通讯作者：
O. Stein
中科院分区：
文献类型：
--
作者：
H. Jongen;O. Stein
我们表明，一个标准的半官僚优化问题的紧凑型可通过具有某些规律性属性的单个平滑函数的级别来近似，我们使用原始问题的karush – kuhn – tucker点与平滑问题之间的对应关系，以及它们相关的摩尔斯索引索引之间的对应关系，以证明所谓的半限定问题的最小最小及时挖掘。
We show that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain regularity properties. This function is constructed as the mollification of the lower level optimal value function. Moreover, we use correspondences between Karush–Kuhn–Tucker points of the original and the smoothed problem, and between their associated Morse indices, to prove the connectedness of the so-called min–max digraph for semi-infinite problems.