...
【24h】

A smoothing Newton method or minimizing a sum of Euclidean norms

机译:平滑牛顿法或最小化欧几里德范数的和

获取原文
获取原文并翻译 | 示例
           

摘要

We consider the problem of minimizing a sum of Euclidean norms, f (x) = Sigma (m)(i=1) (i) - A(i)(T) x. This problem is a nonsmooth problem because f is not differentiable at a point x when one of the norms is zero. In this paper we present a smoothing Newton method for this problem by applying the smoothing Newton method proposed by Qi, Sun, and Zhou [Math. Programming, 87 (2000), pp. 1-35] directly to a system of strongly semismooth equations derived from primal and dual feasibility and a complementarity condition. This method is globally and quadratically convergent. As applications to this problem, smoothing Newton methods are presented for the Euclidean facilities location problem and the Steiner minimal tree problem under a given topology. Preliminary numerical results indicate that this method is extremely promising. [References: 38]
机译:我们考虑最小化欧几里德范数之和的问题,f(x)= Sigma(m)(i = 1) b(i)-A(i)(T)x 。这个问题是一个非平滑问题,因为当其中一个范数为零时,f在点x处是不可微的。在本文中,我们通过应用由齐,孙,周提出的平滑牛顿方法,提出了针对该问题的平滑牛顿方法。 Programming,87(2000),pp.1-35]直接涉及由原始和对偶可行性以及互补条件导出的强半光滑方程组。该方法是全局和二次收敛的。作为对此问题的应用,针对给定拓扑结构下的欧几里得设施位置问题和Steiner最小树问题,提出了平滑牛顿法。初步的数值结果表明该方法是非常有前途的。 [参考:38]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号