查询词典 unconstrained

With the idea of smoothing Newton method, we propose a new class of smoothing Newton methods for the nonlinear complementarity problem based on a class of special functions. In this paper, complementarity problem is converted into a series of smoothing nonlinear equations and a modified smoothing Newton algorithm is used to solve the equations. We use Newton direction and Gradient direction together in the algorithm which guarantees that our method is globally convergent. Also using another smoothing function, we reformulate the generalized nonlinear complementarity problems defined on a polyhedral cone as a system of smoothing equations and a smooth unconstrained optimization problem. Theoretical results that relate the stationary points of the merit function to the solution of the generalized nonlinear complementarity problems are presented, we use the modified smoothing Newton algorithm in generalized nonlinear complementarity problems, under mild hypothesis, a global convergence is proved.

本文一方面基于现有的各种光滑Newton法的思想和半光滑理论，利用著名的F-B互补函数的光滑形式，首先将互补问题的求解转化为求解一系列光滑的非线性方程组，然后给出了一种修正的光滑Newton法，该方法不仅放宽对函数F的要求，在Newton方程不可解时引入初始效益函数的最速下降方向，而且光滑因子的选择也比较简单可行，同时在适当的条件下，证明了其算法具有全局收敛性；另一方面，借助另一种F-B光滑函数，将多面体锥上的广义互补问题转化为一种光滑形式，讨论了优化问题的稳定点与广义非线性互补问题的解之间的理论关系，并将这种修正的光滑Newton法用于求解广义非线性互补问题中，在适当的条件下，该算法同样具有全局收敛性。

Based on statistical learning theory and optimization theory,unconstrained optimization models for support vector machines are built,and an approximate algorithm-maximum entropy method is given.

本文方法特别易于计算机实现，数值实验结果表明了模型和算法的可行性和有效性。1引言近年来，在V.V apn ik的统计学习理论[1，2]基础上发展起来的支持向量机(Support V ector M ach ine，SVM)正成为机器学习领域中新的研究热点[3，4，5]。

LC1 unconstrained optimization problem was discussed in the second chapter, giving a new trust region method and proving its global convergence and superlinear convergence under some mild conditions .

第二章讨论了LC~1无约束优化问题。给出了一个新的信赖域算法，并在一定的条件下证明了算法的全局收敛性和局部超线性收敛性。

In Chapter 2, combining two types of the preconvex part of modified Broydens family with Armijo line search, we get two algorithms for solving unconstrained optimization problems, and prove these algorithms are global and superlinear convergence under some suitable conditions.

第二章，将两种修改Broyden非凸族与Armijo线搜索相结合，得到了求解无约束最优化问题两种算法，在适当的条件下，证明了这些算法具有全局收敛性和超线性收敛性。

In Chapter 3, we propose two new quasi-Newton type trust region methods for solving unconstrained optimization problems. These algorithms combine two types of the preconvex part of modified Broydens family proposed in chapter 1 with trust region algorithm effectively, they have global convergence property and superlinear convergence rate.

第三章，给出了用来求解无约束最优化问题两种新的拟牛顿信赖域算法，这些算法将第一章给出的两种修改Broyden非凸族与信赖域算法有效结合起来，它们具有全局收敛性和超线性收敛速度。

The system represents an unconstrained set of equations.

这个系统表示一组不受约束的等式。

For boxing constraint of control, trigonometric function transformation was developed to achieve an unconstrained problem.

对于控制变量受箱型约束的问题，采用三角函数转换将其转化为控制无约束问题。

The art work of Wang creates that all put up a straightforward and unconstrained character of young artist, in which contains completely about agonizing, uncertainness and self-deprecating humour.

他的作品中有年轻一代画家直截了当、不受拘束的气质，也有苦闷、疑惑，进而自嘲和幽默的成分。

Trust region method is one of the most popular and effective methods for solving unconstrained optimization problems.

信赖域方法是求解无约束优化问题最常用和有效的方法之一。

Where is my motherland, where is to be unconstrained.

哪里是我的祖国，我就要哪里自由！

According to the clear water experiment, aeration performance of the new equipment is good with high total oxygen transfer coefficient and oxygen utilization ratio.

曝气设备的动力效率在叶轮转速为120rpm～150rpm时取得最大值，此时氧利用率和充氧能力也具有较高值。

The environmental stability of that world - including its crushing pressures and icy darkness - means that some of its most famous inhabitants have survived for eons as evolutionary throwbacks, their bodies undergoing little change.

稳定的海底环境─包括能把人压扁的压力和冰冷的黑暗─意谓海底某些最知名的栖居生物已以演化返祖的样态活了万世，形体几无变化。