首页> 外文期刊>Computational optimization and applications >Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
【24h】

Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems

机译:求解非线性最小二乘问题的正则张量 - 牛顿方法的收敛与评价 - 复杂性分析

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

摘要

Given a twice-continuously differentiable vector-valued function r(x), a local minimizer of r(x)2 is sought. We propose and analyse tensor-Newton methods, in which r(x) is replaced locally by its second-order Taylor approximation. Convergence is controlled by regularization of various orders. We establish global convergence to a first-order critical point of r(x)2, and provide function evaluation bounds that agree with the best-known bounds for methods using second derivatives. Numerical experiments comparing tensor-Newton methods with regularized Gauss-Newton and Newton methods demonstrate the practical performance of the newly proposed method.
机译:给定两次连续可分化的载体值函数R(x),寻求r(x)2的局部最小化器。 我们提出并分析了Tensor-Newton方法,其中R(x)通过其二阶泰勒近似局部置换。 收敛是通过各种订单的正规化来控制的。 我们建立了R(x)2的一阶临界点的全局趋同,并提供了使用第二衍生物的方法的最佳界限的函数评估界限。 数值实验比较Tensor-Newton方法与正则化高斯 - 牛顿和牛顿方法的实际性能,表明了新的方法的实际表现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号