The paper proposes a nonmonotonic BFGS-trust-region algorithm for unconstrained optimization.
给出了一个解无约束最优化问题的非单调的新的BFGS校正的信赖域算法。
An adaptive filter trust region method for large scale unconstrained optimization is proposed.
提出一种解大规模无约束优化问题的自适应过滤信赖域法。
At the second part, nonmonotonic trust region method for unconstrained optimization is studied.
第二部分主要研究无约束最优化问题非单调信赖域法。
Unconstrained optimization method is used to find out the effect of input information on water-make.
用无约束最优化方法求解各输入信息对涌水量的影响。
This unconstrained optimization problem may be transformed into nonlinear algebraic system of equations.
通过变换可将该无约束优化问题转化为求解非线性代数方程组的问题。
Trust region method is a kind of efficient and robust method to solve general unconstrained optimization.
对于一般的无约束优化问题，信赖域方法是一种比较有效的方法。
In this paper, a class of new descent algorithm is proposed to solve unconstrained optimization problems.
研究给出了一类新的求解无约束优化问题的下降算法。
Unconstrained optimization methods include gradient, conjugate direction, Newton, and quasi-Newton methods.
约束最优化方法包括梯度法、共轭方向法、牛顿法和拟牛顿法。
The conjugate gradient method is one of the most efficient methods for solving unconstrained optimization problems.
共轭梯度法是求解无约束优化问题的一类有效方法。
This paper puts forward the adaptive trust-region algorithm based on the conic model for unconstrained optimization.
无 约束优化 问题提出了基于锥模型的自适应信赖域算法。
A nonmonotonic trust region algorithm with line search for unconstrained optimization problems is presented in this paper.
给出无约束最优化的一类带线搜索的非单调信赖域算法。
This book, including unconstrained optimization, the constrained optimization, the dynamic optimization of the calculation of three parts.
本书包括无约束优化计算、约束优化计算、动态优化计算三部分。
The software includes many unconstrained optimization algorithms, we can choose different methods by setting different values for parameters.
此软件综合了多种无约束优化方法，可以通过为参数设置不同的值来选择不同的解题方法。
By using a modified BFGS formula, a BFGS-type trust region method with line search technique for unconstrained optimization problems is proposed.
利用一个修正的BFGS公式，提出了结合线搜索技术的BFGS -信赖域方法，并在一定条件下证明了该方法的全局收敛性和超线性收敛性。
Nondifferentiable exact penalty functions are used to transform a constrained optimization problem into a single unconstrained optimization problem.
借助不可微精确罚函数把约束问题转化为单个无约束问题来处理。
This paper presents a non-monotone curve search method for unconstrained optimization problems and proves its convergence under some mild conditions.
本文提出一类求解无约束优化问题的非单调曲线搜索方法，在较弱条件下证明了其收敛性。
The paper presents a nonlinear conjugate gradient method for unconstrained optimization problem, and proves its global convergence under exact line searches.
该文提出一种无约束优化非线性共轭梯度法，证明了精确线性搜索下的全局收敛性。
Conjugate gradient method is an efficient method in solving problems with unconstrained optimization, which is especially efficient in dealing large dimension.
共轭梯度法是求解大规模无约束优化问题的一种有效方法。
Trust region method is a kind of efficient methods to solve the general unconstrained optimization and its special situation, the nonlinear least squares problems.
对于一般的无约束最优化问题及其特殊情况非线性最小二乘问题而言，信赖域方法是一种有效的方法。
A near maximum-likelihood (ML) multiuser detection algorithm based on unconstrained optimization approach is proposed for code-division multiple access (CDMA) systems.
针对码分多址(CDMA)系统提出了一种基于无约束最优化的近最大似然多用户检测算法。
Punishment function is used to transfer the constrained optimization to unconstrained optimization and the Nelder and Mead Method is used to solve this optimization problem.
采用罚函数将约束优化转化为无约束优化，并用单纯形方法求解。
The idea of conjugate gradient path in unconstrained optimization irradiates us to use this method for solving the linear equality optimization subject to bounds on variables.
无约束优化问题的共轭梯度路径构造的思想启迪我们用其来解带线性等式约束和有界变量约束的优化问题。
In this paper, a computer program for determining near earthquake time and space parameters is designed, on the basis of memory gradient method for unconstrained optimization.
基于无约束最优化问题的记忆梯度法，本文设计了测定近震时空参数的计算机程序。
Pr conjugate gradient method is one of the efficient methods for solving large scale unconstrained optimization problems, however, its global convergence has not been solved for a long time.
PR共轭梯度法是求解大型无约束优化问题的有效算法之一，但是算法的全局收敛性在理论上一直没有得到解决。
Sequential Unconstrained Minimization Techniques (SUMT) are most common and comparatively successful method in constrained optimization.
罚函数法(SUMT)是处理约束优化问题时最常用、也是较为成功的一种方法。
The application scope of differential evolution algorithm is extended to a general multi-objective optimization from unconstrained single-objective optimization.
将微分进化算法的应用范围从求解无约束单目标优化推广到求解一般情形的多目标优化。
The application scope of differential evolution algorithm is extended to a general multi-objective optimization from unconstrained single-objective optimization.
将微分进化算法的应用范围从求解无约束单目标优化推广到求解一般情形的多目标优化。
应用推荐