首页> 美国政府科技报告 >A Class of Derivative-Free Algorithms for Unconstrained Minimization.
【24h】

A Class of Derivative-Free Algorithms for Unconstrained Minimization.

机译:一类无约束最小化的无导数算法。

获取原文

摘要

This thesis is concerned with the problem of calculating the least value of a given function f(x), x = (x1, x2, ...xn),in the case that only values of f are available. One expects that f is twice continuously differentiable but one may suppose that it is preferable not to calculate even one derivative.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号