搜索资源列表
opt
- 计算二维无约束优化的Powell法和坐标轮换法,以及一维搜索的黄金分割法和搜索区间确定的两个子程序.-Calculation of two-dimensional unconstrained optimization method of Powell and coordinate rotation method, as well as one-dimensional search of the golden section method
DFP
- DFP无约束情况下的，0.618和一维搜索模块 没有写界面，可是核心已经实现，要实现界面该不难。-DFP unconstrained case, and 0.618 and one-dimensional search interface module does not write, but the core has been achieved, the interface is not difficult to achieve.
Opt_Steepest
- 最速下降法是一种沿着N维目标函数的负梯度方向搜索最小值的方法。该程序是用最速下降法求无约束最优化解。-Steepest descent method is an N-dimensional objective function along the negative gradient direction of the minimum search method. The program is used steepest descent m
D9R6
- 用于无约束优化的鲍威尔优化方法， 程序中参数解释如下：//P:存放设计变量 //XI：存放两个线性无关的向量 //N：含有N各元素的一维实型数组，用于存储设计变量 //NP:整形变量，用于存储P与xi的维数 //FTOL：迭代精度 //FRET：输出参数，存放目标函数在找到的近似极小值点处的值 //ITER:迭代次数-For unconstrained optimization of the Powell o
One-dimensional_search_method
- 无约束优化问题一维搜索的常用方法：黄金分割法（golden_section.m）、加步搜索法（plus_step_search.m）、牛顿法（newton.m）、抛物线法（parabola.m）-Unconstrained optimization problem of one-dimensional search of the commonly used methods: Golden Section (golden_section.
gold_segmentation_algorithm
- 一维无约束搜索算法―黄金分割算法（MATLAB代码）-Unconstrained one-dimensional search algorithm ——gold segmentation algorithm （MATLAB code）
SBOGA
- 顺序选择遗传算法，可以求解一维无约束优化问题-The order of selection genetic algorithm can solve the one-dimensional unconstrained optimization problems
SBOGA
- SBOGA(顺序选择遗传算法求解一维无约束优化问题),我自己编的，-SBOGA
genetic-algorithm
- 用基本遗传算法求解一维无约束优化问题 用顺序选择遗传算法求解一维无约束优化问题 用动态线性标定适应值的遗传算法求解一维无约束优化问题 用大变异遗传算法求解一维无约束优化问题 用自适应遗传算法求解一维无约束优化问题 用双切点遗传优化求解一维无约束优化问题 用多变异位自适应遗传优化求解一维无约束优化问题 -The basic genetic algorithm with one-dimensional seque
OptimumDM
- 机械优化设计一维、多维约束、多维无约束优化算法集成。包括：黄金分割法、牛顿法、梯度法、随机方向法、可行方向法等-Optimization of Mechanical Design dimensional, multi-dimensional constraints, multi-dimensional integration of unconstrained optimization. Include: golden section m
NormFitGA
- NormFitGA(动态线性标定适应值的遗传算法求解一维无约束优化问题)-NormFitGA (dynamic linear calibration of genetic algorithm to adapt to the value of one-dimensional unconstrained optimization problems)
myGA
- 用基本遗传算法求解一维无约束的优化问题。-The basic genetic algorithm with a one-dimensional unconstrained optimization problem
MMAdapGA
- 遗传算法：用多变异位自适应遗传优化求解一维无约束优化问题-Genetic algorithm: changing ectopic adaptive genetic optimization to solve the one-dimensional unconstrained optimization problem
wuyueshuyiweijizhi
- 最优化计算中一维无约束极值问题，适合初学者入门学习！-Optimize the calculation of one-dimensional unconstrained extremum problem, suitable for beginner to learn!
AdapGA
- 自适应遗传算法求解一维无约束优化问题，matlab程序。-Adaptive genetic algorithm for one-dimensional unconstrained optimization problems, matlab program.
AdapGA
- AdapGA 用自适应遗传算法求解一维无约束优化问题 -AdapGA with adaptive genetic algorithm for one-dimensional unconstrained optimization problems
DblGEGA
- DblGEGA 用双切点遗传优化求解一维无约束优化问题 -DblGEGA with double tangent point genetic optimization one-dimensional unconstrained optimization problems
GMGA
- GMGA 用大变异遗传算法求解一维无约束优化问题 -GMGA large variation genetic algorithm to solve the one-dimensional unconstrained optimization problem
SBOGA
- SBOGA 用顺序选择遗传算法求解一维无约束优化问题 -SBOGA order to select genetic algorithm for solving one-dimensional unconstrained optimization problems
无约束一维极值问题
- 求一维无约束问题的最优解。包括很多传统的优化算法如牛顿法等。(Using Newton method to find the optimal solution of one dimensional unconstrained problems.)