1) multi-constraints optimization problem
多约束优化问题
2) unconstrained multiple variable optimization
无约束多元优化问题
1.
method is applied in solving unconstrained multiple variable optimization, and the concrete arithmetic process is given in this paper.
将一维优化方法中的黄金分割法推广应用于无约束多元优化问题的求解中 ,给出了具体的算法实施过程 ,并与目前现有的几种确定性求导寻优法进行了理论比较 。
4) unconstrained optimization problem
无约束优化问题
1.
One Method for Unconstrained Optimization Problems;
一种无约束优化问题的算法
2.
A new conjugate gradient method is proposed for solving unconstrained optimization problems to update and prove the method with Wolfe line search convergece globally.
提出了求解无约束优化问题的一种新的共轭梯度法,修正了βk,并在Wolfe线搜索下证明了它的全局收敛性。
3.
Then the simplex algorithm is applied for the solution of unconstrained optimization problem.
针对球约束凸二次规划问题,利用Lagrange对偶将其转化为无约束优化问题,然后运用单纯形法对其求解,获得原问题的最优解。
5) constrained optimization problems
约束优化问题<