【作者】 张可村； 王燕军；

【Author】 ZHANG Kecun WANG Yanjun Dept.of Scientific Computation and Applied Software, Xi’an Jiaotong University, Xi’an 710049

【机构】 西安交通大学科学计算与应用软件系；

【摘要】 本文充分利用符号无约束几何规划的特点,并结合信赖域算法的技巧,构造出了一种快速收敛算法,算法的搜索方向由序列方程组的解产生,且在相对弱的条件下,分析证明了算法的全局收敛性和局部二次收敛性,最后用计算实例,检验了算法的可行性。更多还原

【Abstract】 A rapidly convergent algorithm is developed for signomial geometric programming without constraints. The algorithm makes full use of the characteristics of signomial geometric programming and the thought of trust region algorithm. Its search directions are determined by the solutions of sequential quadratic programming. We prove global and local quadratic convergence on less conditions , and give some numerical tests to demonstrate the effectiveness.更多还原