查询词典 projection gradient method
- 与 projection gradient method 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
Furthermore, the first-order optimality condition and its equivalent reformulations for generalized semi-infinite max-min programming with a non-compact set are presented using the lower-Hadamard directional derivative and subdifferential.2. Chapter 3 studies the gradient-type methods for unconstrained optimization problems. Section 1 proposes a new class of three-term memory gradient methods. The global convergence property of the method is established. Furthermore, in order to improve the convergence property of the method, a new class of memory gradient projection methods is presented with the property that the whole sequence of iterates converges to a solution to the problem under the conditions such as pseudo-convexity and continuous differentiability of objective function. In section 2, two new classes of methods, called gradient-type method with perturbations and hybrid projection method with perturbations, are proposed. In these methods, non-monotone line search technique is employed, which makes them easily executed in computer.
第3章研究了无约束优化问题的梯度型算法,第1节提出了一类新的三项记忆梯度算法,讨论了算法的全局收敛性,进一步提出了一类新的具有更好收敛性质的记忆梯度投影算法,并证明了该算法在函数伪凸的情况下具有整体收敛性,第2节在非单调步长搜索下提出了带扰动项的梯度型算法及其混合投影算法,这两类算法的一个重要特征就是步长采用线搜索确定而不象许多文献中那样要求步长趋于零,这样更容易在计算机上实现,在较弱的条件下证明了这些算法的全局收敛性,数值算例表明了算法的有效性。
-
By means of the projection method,adding a small disturbing function to the objective function, the penalty method, andthe gradient method, this dissertation proposes several neural networks for solvingsaddle point problems and minimum radius of ball-coverings problems, and investi-gates the stability of the proposed networks by the LaSalle invariance principle andthe Lyapunov method, so as to design neural networks which avoid getting stuck inthe local minimum.
本文针对约束鞍点问题和球覆盖最小半径的计算问题,分别利用投影法、对目标函数加上很小"扰动函数"的逼近法、罚函数法和梯度法等建立神经网络模型进行求解,并基于LaSalle不变集原理和Lyapunov直接法等工具,对模型的动态特性进行研究,从而设计出避免陷入局部极小的优化计算神经网络模型。
-
In chapter 2 we propose a linear equality constraint optimization question , the new algorithm is combined with the new conjugate gradient method(HS-DY conjugate gradient method)and Rosen"s gradient projection method , and has proven it"s convergence under the Wolfe line search.In chapter 3 we have combined a descent algorithm of constraint question with Rosen"s gradient projection, and proposed a linear equality constraint optimization question"s new algorithm, and proposed a combining algorithm about this algorithm, then we have proven their convergence under the Wolfe line search, and has performed the numerical experimentation.
在第三章中我们将无约束问题的一类下降算法与Rosen投影梯度法相结合,将其推广到线性等式约束最优化问题,提出了线性等式约束最优化问题的一类投影下降算法,并提出了基于这类算法的混合算法,在Wolfe线搜索下证明了这两类算法的收敛性,并通过数值试验验证了算法的有效性。
-
Then depended on the Gradient Projection Method, the gradient projection direction is deduced. The gradient direction is the basement for sensitivity analysis.
接着,根据投影梯度法,推导出了投影梯度方向,该方向是灵敏度分析的基础。
-
The projection gradient method will be a possible way to solve the problem that we just get. It has been shown that the projections of the every directions, of which is the boundary point in linear restraint problems, are the possible decent directions, and the projection of negative grads direction is a decent direction. In 1960, Rosen proposed the basic idea of projection gradient methods, and then lots of researchers have been tried to find the convergence of this method. But most of them get the convergence with the condition to amend the convergence itself.
在约束最优化问题的算法中怎样寻找有效的下降方向是构造算法的重要内容,在寻找下降方向方面可行方向法中的投影梯度法有效的解决了下降方向的寻找问题,利用线性约束问题边界点的任意方向在边界上的投影都是可行方向,而负梯度方向的投影就是一个下降方向。60年代初Rosen提出投影梯度法的基本思想,自从Rosen提出该方法以后,对它的收敛性问题不少人进行了研究,但一般都是对算法作出某些修正后才能证明其收敛的,直到最近对Rosen算法本身的收敛性的证明才予以解决。
-
But the projection used in gradient projection method is an orthogonal projection which does not contain the second derivative information of objective and constrained functions,thus the convergence rate of gradient projection method is not contented.
但是,梯度投影法所采用的投影是正交投影,不包含目标函数和约束函数的二阶导数信息·因而;收敛速度不太令人满意。
-
Until recently, the convergence of the Rosen"s arithmetic has been proved. The projection gradient method is the generalization of Steepest decent method to constraint problem. So it does have a faster convergence speed that the fastest decent method . To solve the problem, many researchers have generalizat the well-developed optimization with unconstraint to the Rosen"s gradient method. The conjugate gradient method is one of success to solve the problem.
投影梯度法是最速下降法对约束问题的推广,因此没有较快的收敛速度,为了解决这个问题很多中外学者把发展得比较成熟的无约束最优化算法作类似的推广,其中共轭梯度方法是近年发展的很成熟的方法,它具有计算简单,算法结构好,计算量少,具有良好的收敛性等优点,而Rosen投影梯度法的提出使寻找下降方向变得简单。
-
By using generalized projection matrix, conditions are given on the scalars in the three term-memory gradient direction to ensure that the three term-memory gradient projection direction is a descent direction. A new three term-memory gradient projection method for nonlinear programming with nonlinear equality and in-equality constraints is presented.
利用广义投影矩阵,对求解无约束规划的三项记忆梯度算法中的参数给一条件,确定它们的取值范围,以保证得到目标函数的三项记忆梯度广义投影下降方向,建立了求解非线性等式和不等式约束优化问题的三项记忆梯度广义投影算法,并证明了算法的收敛性。
-
A problem of cable force optimization of cable-stayed bridge is equated as a nonlinear implicit optimization model. In the mathematical model, the object function is minimizing summation of bending strain energy and axial strain energy, and the constrain conditions are nonlinear and related to reasonable finished dead state. The optimization model is solved by projection gradient method, fully considering all kinds geometric nonlinearity.
把超千米级斜拉桥的索力优化问题归结为非线性隐式优化的数学模型,以系统最小弯压应变能为目标,根据合理成桥状态指定各种非线性约束条件,利用投影梯度法进行优化问题的求解,求解过程中充分考虑了各种几何非线性的影响。
-
Furthermore, we solve the user equilibrium problem by gradient projection method to obtain some additional path-based information. Since true OD trip demands are unknown, we conduct OD demand estimation and OD demand covering rate verification by the least square estimator.
在求解使用者均衡之交通量指派问题上,透过梯度投影法(Gradient projection, GP)求解,并获得以路径为基础的相关资讯;在流量倒推旅次起迄量的课题上,由於真实OD量未知,故使用基本的最小平方估计量,进行旅次起迄需求涵盖量的推估与检验。
- 推荐网络例句
-
I can not make it blossom and suits me
我不能让树为我开花
-
When temperatures are above approximately 80 °C discolouration of the raceways or rolling elements is a frequent feature.
当温度高于 80 °C 左右时,滚道或滚动元件褪色是很常见的特征。
-
The lawyer's case blew up because he had no proof.
律师的辩护失败,因为他没有证据。