抽象的

A Nonmonotone Line Search combination algorithm for unconstrained optimization problems

Ping Hu, Xiaocai Wang


In this paper we propose a nonmonotone line search combination rule for unconstrained optimization problems and show that it possesses the global convergence property. We establish the corresponding algorithm and illustrate its effectiveness by virtue of some numerical tests. Simulation results indicate that the proposed method is very effective


免责声明: 此摘要通过人工智能工具翻译,尚未经过审核或验证

索引于

  • 中国社会科学院
  • 谷歌学术
  • 打开 J 门
  • 中国知网(CNKI)
  • 引用因子
  • 宇宙IF
  • 研究期刊索引目录 (DRJI)
  • 秘密搜索引擎实验室
  • 欧洲酒吧
  • ICMJE

查看更多

期刊国际标准号

期刊 h 指数

Flyer