...
首页> 外文期刊>SIAM Journal on Optimization: A Publication of the Society for Industrial and Applied Mathematics >A TRUST REGION METHOD FOR FINDING SECOND-ORDER STATIONARITY IN LINEARLY CONSTRAINED NONCONVEX OPTIMIZATION
【24h】

A TRUST REGION METHOD FOR FINDING SECOND-ORDER STATIONARITY IN LINEARLY CONSTRAINED NONCONVEX OPTIMIZATION

机译:一种信任区域方法,用于在线性约束非凸优化中查找二阶保管性

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

获取外文期刊封面封底 >>

       

摘要

Motivated by the TRACE algorithm [F. E. Curtis, D. P. Robinson, and M. Samadi, Math. Program., 162 (2017), pp. 1-321, we propose a trust region algorithm for finding second-order stationary points of a linearly constrained nonconvex optimization problem. We show the convergence of the proposed algorithm to (epsilon(g), epsilon(H))-second-order stationary points in (O) over tilde (max{epsilon(-3/2)(g), epsilon(-3)(H)}) iterations. This iteration complexity is achieved for general linearly constrained optimization without cubic regularization of the objective function.
机译:通过跟踪算法[F. E. Curtis,D.P. Robinson和M. Samadi,Math。 计划。,第162(2017),第1-321页,我们提出了一种信任区域算法,用于查找线性受限的非凸化优化问题的二阶固定点。 我们展示了所提出的算法(ε(g),ε(h)) - (o)上的二阶固定点(Max {epsilon(-3/2)(g),ε(-3) )(h)})迭代。 对于一般线性约束优化来实现这种迭代复杂性,而无目标函数的立方正则化。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号