共被期刊论文引用了3次
您的检索式：您选中1篇文献正在查看引证文献汇总
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | 一簇非线性等式约束优化问题的过滤线搜索修正正割方法显示文摘本文提供了一簇新的过滤线搜索修正正割方法求解非线性等式约束优化问题.新算法簇的特点是:用修正正割算法簇中的一个算法获得搜索方向,回代线搜索技术得到步长,过滤准则用来决定是否接受步长,引入二阶校正技术减少不可行性并克服Maratos效应.在合理的假设条件下,分析了算法的总体收敛性.并证明了,通过附加二阶校正步,算法簇克服了Maratos效应,并二步Q-超线性收敛到满足二阶充分最优条件的局部解.数值结果表明了所提供的算法具有有效性. | 王祝君 朱德通 | 2012 | 应用数学学报2012，35，3： | 2 |
| 2 | A Dwindling Filter Line Search Algorithm for Nonlinear Equality Constrained Optimization显示文摘This paper proposes a dwindling filter line search algorithm for nonlinear equality constrained optimization. A dwindling filter, which is a modification of the traditional filter, is employed in the algorithm. The envelope of the dwindling filter becomes thinner and thinner as the step size approaches zero. This new algorithm has more flexibility for the acceptance of the trial step and requires less computational costs compared with traditional filter algorithm. The global and local convergence of the proposed algorithm are given under some reasonable conditions. The numerical experiments are reported to show the effectiveness of the dwindling filter algorithm. | GU Chao ZHU Detong | 2015 | Journal of Systems Science & Complexity2015，28，3： | 2 |
| 3 | Simplifying the Nonlinear Continuous Time-Cost Tradeoff Problem显示文摘Equivalent simplification is an effective method for solving large-scale complex problems. In this paper, the authors simplify a classic project scheduling problem, which is the nonlinear continuous time-cost tradeoff problem(TCTP). Simplifying TCTP is a simple path problem in a critical path method(CPM) network. The authors transform TCTP into a simple activity float problem and design a complex polynomial algorithm for its solution. First, the authors discover relationships between activity floats and path lengths by studying activity floats from the perspective of path instead of time.Second, the authors perform simplification and improve the efficiency and accuracy of the solution by deleting redundant activities and narrowing the duration intervals of non-redundant activities. Finally,the authors compare our method with current methods. The relationships between activity floats and path lengths provide new approaches for other path and correlative project problems. | SU Zhixiong QI Jianxun WEI Hanying | 2017 | Journal of Systems Science & Complexity2017，30，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员