登录
首页 » matlab » Optimization

Optimization

于 2008-12-18 发布 文件大小:2KB
0 245
下载积分: 1 下载次数: 317

代码说明:

  约束最优化方法--最速下降法(也叫梯度法),是人们用来求多个变量函数极值问题的最早的一种方法。(Constrained optimization methods- steepest descent method (also known as gradient method), is used for multiple variables function Extremum Problems earliest methods.)

文件列表:

变尺度.txt
最速下降法.txt
牛顿法.txt
阻尼Newton法.txt

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 3d
    说明:  fortran 学习软件非常有用啊,请管理员加我。
    2009-07-07 19:18:28下载
    积分:1
  • Linear Algebra Package
    说明:  特征值分解,HouseHolder分解等(matlab Linear Algebra Package)
    2019-11-06 22:20:41下载
    积分:1
  • f77
    常见的各类数值和字符算法,包括微积分、插值、矩阵、微分方程、方程组求解和字符串操作等,Fortran77版本,可直接用于各位自己的代码开发中(Most common algorithms, including numerical and char recipes, Fortran 77 version, can be used in your own program develpment directly)
    2016-03-30 09:52:06下载
    积分:1
  • mijidu
    海冰密集度的matlab计算程序和分析!(The sea ice concentration matlab procedures and analysis!)
    2020-07-03 10:00:02下载
    积分:1
  • Roughset_GetRules
    关于粗糙集对属性进行约简,一个很好的计算工具(On rough set of attributes about Jane, a very good tool)
    2007-11-26 15:30:37下载
    积分:1
  • Sod
    利用5阶WENO有限差分法求解一维Euler方程组,给出求解Sod型激波管问题的详细程序。(The use of 5-order WENO finite difference method for solving one-dimensional Euler equations given type of shock tube problem solving Sod detailed procedures.)
    2014-02-07 11:03:08下载
    积分:1
  • 0-1
    说明:  用LINGO求解最短路径问题,此方法为0-1规划,只适用于简单的ILP问题。(Lingo is used to solve the shortest path problem, which is a 0-1 programming method. It is only suitable for simple ILP problems.)
    2020-05-04 08:21:21下载
    积分:1
  • guochengcanshu
    标准节流件的计算中,利用软件MATLAB进行迭代计算(Standard Throttle pieces of the calculation, using MATLAB software iterative calculation)
    2007-06-04 12:02:31下载
    积分:1
  • jiheraoshelilun
    几何绕射理论,是高频解决电磁场问题的方法,本书很具有代表性(GTD is a high-frequency electromagnetic fields to solve the problem, this book is a representative)
    2008-04-24 12:07:21下载
    积分:1
  • 单纯形法Matlab程序-2016-11-17
    一般线性规划问题具有线性方程组的变量数大于方程个数,这时会有不定的解。当决策变量个数n和约束条件个数m较大时,单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形,每一个单纯形可以求得一组解,然后再判断该解使目标函数值是增大还是变小了,决定下一步选择的单纯形。通过优化迭代,直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)
    2018-03-27 17:22:03下载
    积分:1
  • 696516资源总数
  • 106562会员总数
  • 4今日下载