搜索资源列表
hjfg
- 优化设计一维搜索方法的黄金分割法，又称作0.618法！-Optimal Design of one-dimensional search method of golden section method, also known as the 0.618 Act!
008
- 无约束优化方法，黄金分割法求函数极值，一维搜索问题-Unconstrained optimization methods, golden section method for extreme value function, one-dimensional search problems
3
- 机械优化设计中最基本的优化算法——一维搜索，它是其他算法的基础，简单，但很重要-Optimize the design of the basic machinery of the optimization algorithm- one-dimensional search, which is the basis for other algorithms, simple, but very important
ResolveOptmizationProblemswithconjugategradientmet
- 压缩包中有两个程序代码，一个是共轭梯度法求最优解，一维搜索用的是不精确搜索法，另一个是从键盘输入方程表达式的程序代码-There are two compression package code, a conjugate gradient method for optimal solution, one-dimensional search using a search method inaccurate, and the other is from the keyboard input cod
success_failure_way
- 本程序是最优化理论中一维搜索方法之一——成功失败法的实现-linear search
quadraticinterpolationalgorithm
- 利用二次插值法进行一维搜索，得出最小值，通过抛物线法实现区间识别-Quadratic interpolation method using a one-dimensional search, the minimum value obtained by the parabola method to achieve Interval Recognition
1dsearch
- 最优化问题的一维搜索，在工程当中应用广泛，解决实际操作设计中的最优化问题。-Optimization problem of one-dimensional search, which are widely used in engineering to solve practical design optimization problem.
1
- 利用c语言编写的最速下降法程序，其中包括利用进退法和0.618法进行的一维搜索-Using c language of the steepest descent procedure, including the advance and retreat method and 0.618 using one-dimensional search method
golden
- 黄金分割法：机械优化设计，一维搜索中，求最小值-Golden section method: mechanical optimal design, one-dimensional search, find the minimum
PunishExp
- 惩罚函数法,外点法，用鲍威尔无约束搜索和牛顿法一维搜索-Penalty function, external point method, using Powell' s search and Newton method for unconstrained one-dimensional search
lhplph
- 最优化中的一维搜索的最优化方法：黄金分割法计算最优解-Optimization of the golden section method to compute the optimal solution
0.618
- 一维搜索0.618黄金分割点算法，只适用于单峰函数的局部搜索。经过编译。-One-dimension search algorithm, Gold segmentation algorithm .It applies only to the local search of single-peak function.
DFP
- DFP计算算法(精确一维搜索,花费时间很少) -DFP calculation algorithm (exact one-dimensional search, spent little time)
FR
- 无约束优化FR算法的MATLAB实现源代码（不精确一维搜索）-FR algorithm for unconstrained optimization MATLAB implementation source code (inexact one-dimensional search)
SIMPSION-INTEGRAL
- 用辛普森方法计算积分,只能计算一重积分。程序为变步长辛普森积分法。其中包含有一维搜索的程序。-Integration with the Simpson method
cg
- 该程序是用共轭梯度法来求解函数的最优化问题，其中一维搜索时采用了0.618法，即黄金分割法-The program is the conjugate gradient method to solve the function optimization problem, one-dimensional search using the 0.618 method, that is, golden section method
huangjin
- 一维搜索的黄金分割C++算法，内附图片以供参考-#include "stdafx.h" #include<iostream> using namespace std
zniniudunzhiyi_AG
- 拟牛顿算法，H矩阵由秩1算法得到，一维搜索由ArmigoGoldstein实现-Quasi-Newton algorithm, H matrix by the rank 1 algorithm, to achieve one-dimensional search by the ArmigoGoldstein
Objective-function-extremum
- 采用了精确一维搜索法进行目标函数求极值，其中使用了黄金分割法，最速下降法和拟牛顿法。-Using the exact one-dimensional search method to the objective function extremum, which uses the golden section method, steepest descent and quasi-Newton method.
huangjinfengefa
- 机械优化设计中的一维搜索方法：黄金分割法-Optimization of Mechanical Design of one-dimensional search methods: golden section method