搜索资源列表
newton 采用牛顿法实现简单的无约束的最优化问题
- 采用牛顿法实现简单的无约束的最优化问题，本程序实现简单的计算，计算无约束最优化问题的最优解-Using Newton' s method to achieve a simple optimization problem without constraints
jianmochengxu
- 本文以提取靶标圆心像坐标为主要研究目标。用到了灰度处理、图像二值化、八邻域连通法、最小二乘法、无约束最优化等知识。 -In this paper, to extract the target coordinates of the center as the main research objectives. Use the gray processing, image binarization, the eight-neighbor connectivity method, least sq
TransferOptimizationConstraintNonbindingProcedures
- 转最优化-约束 无约束共轭梯度法程序（c++）-Switch Optimization- constrained conjugate gradient method for unconstrained program (c++)
steepest_descend_method
- c++求极值，利用无约束最优化中的最简单的最速下降法从负梯度方向来求得极值-c++ extremum, the use of unconstrained optimization of the most simple steepest descent method to obtain from the extreme negative gradient direction
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.
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
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)
《最优化理论与算法》－陈宝林
- 此书包含线性规划单纯形方法、对偶理论、灵敏度分析、运输问题、内点算法、非线性规划K-T条件、无约束最优化方法、整数规划和动态规划等。(This book includes linear programming, simplex method, duality theory, sensitivity analysis, transportation problem, interior point algorithm, nonlinear programming K-T condition, unc
最优化实验外惩罚函数法
- 最优化实验外惩罚函数法，我们根据约束的特点，构造某种惩罚函数，然后加到目标函数中去，将约束问题求解转化为一系列的无约束问题。这种“惩罚策略”，对于无约束问题求解过程中的那些企图违反约束条件的目标点给予惩罚。(According to the characteristics of constraints, we construct some penalty function, and then add it to the objective function to transform the co