摘要
对无约束规划(P):minf(x),其中f(x)是R^n→R^1上一阶连续可微函数,构造了一类特殊的共轭方向求解算法,并运用强迫函数和比较原理等工具,统一证明了算法在六种步长搜索之下的整体收敛性.
special conjugate direction solving process to unrestricted programming (P): minf(x) is obtained. Among it, f(x) is the first - order continunously differential function on Rn→R1. The global convergence of algorithm under the six kinds of steplength search is proved .with forcing function and comparison principle.
出处
《洛阳大学学报》
1995年第4期1-6,共6页
Journal of Luoyang University
基金
国家自然科学基金资助项目
编号 09274433