填充函数是一种解无约束全局极小化问题的方法,这种方法的关键是构造填充函数.

The Filled Function Method is an approach for solving unconstrained global minimization problem.

通过最小化能量方案极小化代价函数，同时通过定点交替迭代策略将非线性方程进行线性化处理，快速恢复图像。

The cost functions are minimized by alternate minimization scheme. The nonlinear equations are linear by fixed-point iteration scheme.

在局限下极大化的假设下，竞争形式的选择一定是基于交易费用的局限下极小化的。

Under the postulate of constrained maximization, the choice of the form of competition is always a result of constrained transaction cost minimization.

将多用户类型随机用户平衡问题表示为一个无约束极小化问题，并提出了该问题的一种基于路段水平的灵敏度分析方法。

The stochastic user equilibrium with multiple user groups is represented as an unconstrained minimization problem solution and a sensitivity analysis method based on link level is proposed for it.

摘要讨论了单机分批排序问题中目标是极小化加权总完工时间的问题.

The problem of minimizing the total weighted completed time on single batch processing machine is studied.

计算了蛋白质序列中紧邻三联体的出现个数，利用离散增量极小化对凋亡蛋白进行定位预测；

By use of adjacent triune residues contents in the protein primary sequences, the increment of diversity is calculated to predict the subcellular location of apoptosis proteins.

应用黄金分割法和元素交替极小化法对扩展的卡尔曼滤波初值条件进行搜索并获得优化解。

Initial value conditions on Expanded-Kalman-Filter are searched by Gald-Cutting and Component-Minimum methods, and then optimized.

本文利用求非线性方程组极小化全局收敛法的思路，提出了控制迭代收敛次数、控制反演解稳定的方法。

This paper has proposed a method controlling iteration number and stability of solution according to thought of integral convergence algorithm minimizing nonlinear equations.