而且线搜索中的罚参数的选择通常比较困难。
Moreover the choice of penalty function in line search is difficult.
本文改进了带线性约束0 - 1二次规划问题的罚参数下界。
In this paper, penalty parameter for linearly constrained 0-1 quadratic programming is improved.
在较为温和的条件下证明了方法的全局收敛性，及罚参数只需进行有限次调整。
It is shown that this method possesses global convergence and the penalty parameters are adjusted only finite times under mild conditions.
对这一算法给出了精细的收敛性结果，证明了存在罚参数的一个阈值，当罚参数小于这个阈值时，算法收敛。
Detailed convergence results for the dual algorithm are given and it is proved that there exists a threshold, and the algorithm will converge if the penalty parameter is less than the threshold.
构造了一种无参数罚函数，并用这种无参数罚函数方法求解约束最优控制问题，最后举例以说明．。
The method of parameter-free penalty function is discussed and used here to solve the constrained optimal control problem; Finally an example is cited in illustration of the theory…
构造了一种无参数罚函数，并用这种无参数罚函数方法求解约束最优控制问题，最后举例以说明．。
The method of parameter-free penalty function is discussed and used here to solve the constrained optimal control problem; Finally an example is cited in illustration of the theory…
应用推荐