1) unconstrained optimization
无约束优化
1.
A class of conjugate gradient methods for unconstrained optimization;
一类无约束优化问题的的共轭梯度法
2.
Methods based on semi-diagonal implicit Runge-Kutta formulae for unconstrained optimization;
基于对角隐式Runge-Kutta公式的无约束优化方法
3.
A hybrid genetic algorithm to seeking the optimum solution of a class of unconstrained optimization;
求解一类无约束优化的混合遗传算法
2) constrained or unconstrained optimization
无约束及有约束最优化
3) unconstrained optimization
无约束最优化
1.
A New Conjugate Gradient Algorthm for Unconstrained Optimization;
一个新的无约束最优化的共轭梯度算法
2.
A nonmonotonic trust region algorithm with line search for unconstrained optimization problems is presented in this paper.
给出无约束最优化的一类带线搜索的非单调信赖域算法。
3.
A class of nonlinear conjugate gradient methods for new nonlinear conjugate type formula of solving unconstrained optimization problems has been proposed.
研究求解无约束最优化问题的共轭梯度法,提出了一种新的共轭梯度类型公式,从而影响了算法产生的搜索方向,进一步影响了算法的效果,得到一类新共轭梯度法,证明了在G rippo-Luc id i线搜索下新共轭梯度法的全局收敛性。
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) unconstrained optimization problems
无约束优化问题
1.
This paper,based on BFGS method,presents an artificial neural network model for unconstrained optimization problems,and some stability properties of the neural network are discussed.
提出了一种基于BFGS算法的求解无约束优化问题的人工神经网络模型,并对该模型的稳定性作了理论分析。
2.
In this thesis,the equivalence between a class of variational inequalities problems,which are in condition of some generalized convexity,and a class of unconstrained optimization problems is mainly studied.
本文主要研究了一类变分不等式问题在满足一定的广义凸性的前提下,与一类无约束优化问题的等价性关系。
3.
It can be applied to construct limited memory quasi-Newton method for unconstrained optimization problems when a vector is specially chosen.
提出一族紧凑格式的拟牛顿矩阵修正公式,适当选择其中某个向量情况下,该族可以很方便的用于构造求解大型无约束优化问题的有限存储拟牛顿算法。
6) unconstrained optimization method
无约束优化方法
补充资料：无约束优化
分子式：
CAS号：
性质：没有约束条件的优化问题。如minf(x)，x∈En，其中f(x)是定义在En上的实函数，min表示极小化。该优化问题没有约束条件。
CAS号：
性质：没有约束条件的优化问题。如minf(x)，x∈En，其中f(x)是定义在En上的实函数，min表示极小化。该优化问题没有约束条件。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条