该迭代式被证明是二次收敛的。
The convergence of this method is proved mathematically to be of the second order.
该方法被证明具有超线性和二次收敛性。
The proposed methods are proved to possess the superlinear and quadratic convergence.
该迭代算法具有几乎二次的收敛率，在某些条件下达到了二次收敛。
The rate of convergence is nearly quadratic, and is quadratic under some additional conditions.
进行了收敛性分析，得到整体收敛及局部二次收敛性结果，并给出了算法的执行过程及算例。
This algorithm with new strategy is analyzed and the global and local quadratic convergent theorems are proved. At last, the implementation and computational results of the algor...
进行了收敛性分析，得到整体收敛及局部二次收敛性结果，并给出了算法的执行过程及算例。
This algorithm with new strategy is analyzed and the global and local quadratic convergent theorems are proved. At last, the implementation and computational results of the algorithm are...
进行了收敛性分析，得到整体收敛及局部二次收敛性结果，并给出了算法的执行过程及算例。
This algorithm with new strategy is analyzed and the global and local quadratic convergent theorems are proved. At last, the implementation and computational results of the algorithm are demons...
详细分析和论证两个模型的局部超线性收敛性及二次收敛性条件，其中并不需要严格互补条件。
The local superlinear and quadratic convergence of this two models under some mild conditions without the strict complementary condition are analysed and proved.
在基本差分进化算法中，融入递增二次函数交叉算子以增加算法的收敛速度。
For the basic differential evolution algorithm, the increasing quadratic function crossover operator was added to increase the convergence speed.
能二次清洁残留肌肤的污垢和化妆品，有效收敛毛孔及平衡皮肤PH值，兼具软化肌肤，为肌肤补充水份的功效，有效修复受损的肌肤。
It can clean the dirt and cosmetics remained in the skin for a second time, effectively astringe pore and balance skin PH value, as well as soften skin, replenish skin fluid, and repair damaged skin.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed. The convergence of the algorithm is discussed.
由于序列二次规划（SQP）算法具有快速收敛速度，所以它是求解光滑约束优化问题的有效方法之一。
Sequential quadratic programming (SQP) method is an efficient method for solving smooth constrained optimization problems because of its fast convergence rate.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.
基于此策略，结合序列二次规划(SQP)方法，并利用滤子以避免罚函数的使用，提出了一类积极集s QP滤子方法，并在合理条件下证明了算法的全局收敛性。
Based on this technique and the sequential quadratic programming (SQP) method, a new active set filter SQP method is proposed in which the penalty function is not required by filter strategy.
根据问题的特点，本文采用了收敛速度快、稳定性好的序列二次规划法对模型进行了有效求解。
In view of its features, we use sequence quadratic programming planning to solve the problem effectively, in which convergence carries through fast and the stability is fine.
根据无约束最优化问题的梯度算法，提出了二次梯度算法，并证明了其收敛性。
In this paper, the gradient computational algorithm about unconditional extreme value is given.
根据无约束最优化问题的梯度算法，提出了二次梯度算法，并证明了其收敛性。
In this paper, the gradient computational algorithm about unconditional extreme value is given.
应用推荐