1) convert simple restrict
化简约束
2) simplified restriction
约束简化
4) 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个新算法,得到可行区间的计算公式。
5) 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.
本论文研究求解无约束优化问题和简单界约束优化问题的非线性共轭梯度法,主要讨论这些方法的全局收敛性和数值表现。
6) box constraints
简单界约束
1.
We develop a class of nonmonotone trust-region methods for solving nonsmooth equations with box constraints.
对简单界约束非光滑非线性方程组提出一种新的非单调信赖域算法,信赖域半径与当前迭代点的投影梯度有关,非单调结构为标准结构。
补充资料：公理化方法(见公理化和形式化)
公理化方法(见公理化和形式化)
axiomatical method
gongllbuafangfa公理化方法化和形式化。(axiomatieal method)见公理
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条