1) box constraints
简单界约束
1.
We develop a class of nonmonotone trust-region methods for solving nonsmooth equations with box constraints.
对简单界约束非光滑非线性方程组提出一种新的非单调信赖域算法,信赖域半径与当前迭代点的投影梯度有关,非单调结构为标准结构。
3) simple constraints
简单约束
1.
The algorithm of Hooke-Jeeves using line searches and the algorithm of Hooke-Jeeves with discrete steps are extended such that they can solve simple constraints optimization with general bound.
分别将无约束优化的线搜索和离散步Hooke-Jeeves算法推广到带广义界的简单约束优化,产生2个新算法,得到可行区间的计算公式。
4) bound-constrained optimization
简单界约束优化问题
1.
In this thesis, we study nonlinear conjugate gradient methods for solving un- constrained and bound-constrained optimization problems, we also discuss the global convergence property and numerical performance of these methods.
本论文研究求解无约束优化问题和简单界约束优化问题的非线性共轭梯度法,主要讨论这些方法的全局收敛性和数值表现。
5) simple ordering
简单序约束
1.
By using the EM and ECM algorithm,the maximum likelihood estimate of the parameters which are restricted to the simple ordering,the umbrella ordering or the increasing convex ordering,are given whenever the covariance matrix is known or not.
利用EM算法和ECM算法给出了多元正态模型在协方差阵已知或未知的情况下,参数在简单序约束、伞型序约束和递增的凸序约束条件下的极大似然估计。
6) simple partly ordered restriction
简单半序约束
1.
The paper proposes an alogorithm for a maximum likelihood estimation when covariance matrices are under the condition of one simple partly ordered restriction, i.
本文给出协方差阵在一个简单半序约束０＜∧１≤∧２≤…≤∧ｋ的条件下的最大似然估计的一种算法。
补充资料：发光地寄色界无色界天乘
【发光地寄色界无色界天乘】
谓三地菩萨，明修八禅定行，同于色界四禅，无色界四空处，故云发光地寄色无色界天乘。（八禅定者，色界、无色界各四禅定也。四禅者，初禅、二禅、三禅、四禅也。四空者，即空处、识处、无所有处、非非想处也。）
谓三地菩萨，明修八禅定行，同于色界四禅，无色界四空处，故云发光地寄色无色界天乘。（八禅定者，色界、无色界各四禅定也。四禅者，初禅、二禅、三禅、四禅也。四空者，即空处、识处、无所有处、非非想处也。）
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条