搜索资源列表
quickdrop
- 这是无约束最优化理论的一个小例子，用的是最速下降法。-This is the theory of unconstrained optimization of a small example, using the steepest descent method.
DFP-BFGS-0.618
- DFP,黄金分割点方法，BFGS方法matlab源代码用于求解无约束最优化问题-BFGS，DFP,0.618 method for solving unconstrained optimization problems
qp
- 求解一般线性无约束最优化问题的qp算法程序-Solving the general linear unconstrained optimization algorithm QP procedures
ACG_DESCENTl
- 利用CG_DESCENT算法求解大规模无约束最优化问题，，代码所用语言为Fortran77.，已通过测试。 -Use CG_DESCENT algorithm for solving large-scale unconstrained optimization problems, the code language used is Fortran 77. Has been tested.
BBFGSF
- 利用BFGS算法求解大规模无约束最优化化问题，代码所用语言为Fortran77. -BFGS algorithm for solving large-scale unconstrained optimization of the problem, the code language used is Fortran 77.
GA
- 遗传算法GA求解无约束最优化问题，采用遗传算法求函数的最小值-The genetic algorithm GA for solving unconstrained optimization problems using genetic algorithm for the minimum of the function
UCG_PLUSs
- 利用共轭梯度法（CG+）求解大规模无约束最优化问题，代代码所用语言为Fortran77.， -The conjugate gradient method (CG+) for solving large-scale unconstrained optimization problems, the generation of code language is Fortran 77.
lagrange
- 求解约束最优化问题，一种途径是在可行域内寻找使目标函数值下降的迭代点列，但是这类方法对于带非线性约束的最优化问题求解效果一般都不理想。因此我们利用另一种途径，即利用问题的目标函数和约束函数构造新的目标函数——罚函数，把约束最优化问题转化为相应的罚函数的无约束最优化问题来求解实际问题。-lagrange constraint multiplier method for the minimum
proj_toolbox
- 投影bb法，用于求解非线性无约束最优化问题。-projected bb algorithm
niniudun
- 无约束最优化当中经典的拟牛顿法matlab程序-Unconstrained optimization among classical quasi-Newton method matlab program
xinlaiyu
- 无约束最优化中经典的信赖域方法matlab程序-Trust region methods for unconstrained optimization in classic matlab program
chengzifa
- 无约束最优化中经典的乘子法matlab程序-Unconstrained optimization of classical multiplier method matlab program
gonger
- 无约束最优化中经典的共扼梯度法matlab程序-Unconstrained optimization in classic conjugate gradient method matlab program
zuishuxiajiang
- 无约束最优化中经典的最速下降法matlab程序-The unconstrained optimization Classic in the steepest descent method matlab program
grad
- 最速下降法又称为梯度法，是1847 年由著名数学家Cauchy 给出的，它是解析法中最古老的一种，其他解析方法或是它的变形，或是受它的启发而得到的，因此它是最优化方法的基础。作为一种基本的算法，他在最优化方法中占有重要地位，主要用来求解无约束最优化问题。-the steepest_descend_method
1
- 最速下降法求非线性无约束最优化（函数极值）问题-The steepest descent method for solving nonlinear unconstrained optimization (function extremum) problem
2
- FR共轭梯度法求非线性无约束最优化（函数极值）问题-FR conjugate gradient method for solving nonlinear unconstrained optimization (function extremum) problem
3
- BFGS拟牛顿法求非线性无约束最优化（函数极值）问题-BFGS quasi-Newton method for solving nonlinear unconstrained optimization (function extremum) problem
5
- DFP拟牛顿法求解非线性无约束最优化问题（函数极值）-DFP quasi-Newton method for solving nonlinear constrained optimization problem (function extremum)
Penalty-Function-Method-
- 惩罚函数法C语言相关程序 它将有约束最优化问题转化为求解无约束最优化问题：其中M为足够大的正数， 起"惩罚"作用， 称之为罚因子，F(x, M )称为罚函数。-Penalty Function Method C language-related program it would have constrained optimization problem is transformed into solving unconstrained optimization problem: where