The trust region method is one of the most valid ways to study optimization problems.
信赖域方法是研究最优化问题的有效方法之一。
In chapter 3, we present a nonmonotonic trust region algorithm based on the conic model.
第三章,我们提出了一类基于锥模型的非单调信赖域算法。
The basic idea of these methods is to approximate the optimization problem by a sequence of quadratic minimization problems subject to some trust region.
该类算法的基本思想是通过求解一系列二次函数在信赖域中的极小值点逼近最优化问题的解。
The idea of trust region algorithm was employed to approach the closest critical point.
基于信赖域方法的思想迭代逼近最近电压稳定临界点。
In chapter 3, a new self-adaptive trust region method and its convergence are proposed.
第三章为一个新的自适应信赖域方法及其收敛性。
This paper presents a novel algorithm for the OPF problem based on a trust region method.
文中基于信赖域的思想提出了求解opf的新算法。
An adaptive filter trust region method for large scale unconstrained optimization is proposed.
提出一种解大规模无约束优化问题的自适应过滤信赖域法。
In recent decade, the research on monotone trust region has matured and theory is very perfect.
近几十年来,对单调信赖域方法的研究已经日趋成熟,理论也更加完善。
In chapter 2, we propose a self-adaptive trust region method for system of nonlinear equations.
第二章研究了非线性方程组问题的自适应信赖域方法。
In this paper, we develop a trust region algorithm for convex constrained optimization problems.
本文我们考虑求解凸约束优化问题的信赖域方法。
An attractive property of trust region methods lies in their numerical stability and robustness.
信赖域算法的一个显著优点是其稳定的数值性能。
In this paper, we propose a new class of trust region methods for nonlinear optimization problems.
本文提出一类新的解无约束最优化问题的信赖域方法。
The strong convergence of the algorithm under a general choice for radius of trust region is proved.
在一个很广泛的信赖域半径选择规则下,证明了算法的强收敛性。
This paper presents an interior trust region method for linear constrained LC convex optimization problems.
本文提出一种解线性约束凸规划的数值方法。
In this paper, a trust region method with new conic model for linearly constrained optimization problems is proposed.
本文提出了一个解线性等式约束优化问题的新锥模型信赖域方法。
Both line search and trust region algorithm are well-accepted methods in the optimization to assure global convergence.
线性搜索方法和信赖域方法是保证最优化问题的整体收敛性的两种基本策略。
In chapter 3, we present a self-adaptive trust region method for solving generalized nonlinear complementarity problems.
第三章为广义非线性互补问题的自适应信赖域方法。
A nonmonotonic trust region algorithm with line search for unconstrained optimization problems is presented in this paper.
给出无约束最优化的一类带线搜索的非单调信赖域算法。
We propose a new trust region algorithm for special linear inequality constrained optimization problems with nonnegative bound constraints.
对一类带有非负边界约束的线性不等式约束优化问题进行了研究,提出了一种新的信赖域算法。
This paper is to study the convergence properties of the gradient projection method with trust region strategy for constrained optimization.
本文使用信赖域策略结合投影梯度算法来解约束优化问题,并给出算法及其收敛性。
In this paper, we propose a new trust region algorithm for solving a class of composite nonsmooth optimization subject to convex constraints.
提出了求解一类带一般凸约束的复合非光滑优化的信赖域算法。
By using a modified BFGS formula, a BFGS-type trust region method with line search technique for unconstrained optimization problems is proposed.
利用一个修正的BFGS公式,提出了结合线搜索技术的BFGS -信赖域方法,并在一定条件下证明了该方法的全局收敛性和超线性收敛性。
We apply the popular trust region algorithm and truncated conjugate gradient algorithm with trust region skills to solve trust region subproblems.
应用目前流行的信赖域算法,并用带有信赖域技巧的截断共扼梯度法来解信赖域子问题。
In this paper, we mainly discuss the modified quasi-Newton trust region methods based on a conic model (TRCM method) and prove their convergence properties.
沿袭用锥模型来逼近原问题的思路,本文主要研究锥模型拟牛顿信赖域方法的参数选择、收敛性和数值实现。
In chapter 4, a implementation version is given for the trust region gradient method with memory model. Numerical results show that this scheme is feasible.
第四章给出了带记忆模型信赖域梯度的算法的具体实现方案,数值实验结果表明该方案是可行的。
A new nonmonotonic trust region method is given in this paper. And its global convergence and superlinear convergence are proved. Numerical results are given.
给出一种新的非单调信赖域方法,证明了算法的全局收敛性和超线性收敛性,最后给出了数值结果。
In this paper, a trust region algorithm for general nonlinear equality constrained optimization problems, is presented. The solution of their subproblems is easy.
对一般非线性等式约束最优化问题提出了一种信赖域算法,其子问题较易求解。
Since the homogeneous model can approximate the objective function better than the quadratic model, the new algorithm is superior to the classical trust region algorithm.
由于该模型比二次模型更近似目标函数,故新算法优于传统的信赖域算法。
We present an affine scaling trust region algorithm with interior back - tracking and subspace techniques for nonlinear optimizations subject to linear inequality constraints.
使用仿射变换内点回代技术的信赖域子空间算法解线性不等式约束的非线性优化问题。
We present an affine scaling trust region algorithm with interior back - tracking and subspace techniques for nonlinear optimizations subject to linear inequality constraints.
使用仿射变换内点回代技术的信赖域子空间算法解线性不等式约束的非线性优化问题。
应用推荐