欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
在传统信赖域方法的基础上，提出了求解无约束最优化问题的一个新的带线搜索的信赖域算法．该算法采用大步长Armijo线搜索技术获得迭代步长，克服了每次迭代求解信赖域子问题时计算量较大的缺点，因而适用于求解大型的优化问题．在适当的条件下，我们证明了算法的全局收敛性．数值实验结果表明本文所提出的算法是有效的．
英文摘要：
Based on the traditional trust region method, a trust region algontnm with new nne search is proposed for solving unconstrained optimization problems. The stepsize is ob- tained making use of larger Armijo line search rule. The proposed algorithm overcomes the shortcomings of large amount of calculation when solving the subproblem at each iteration, therefore, it is more attractive for large scale optimization problems. The global convergence of the algorithm is proved under suitable conditions. Some numerical results are reported, which shows that our algorithm is quite effective.
同期刊论文项目
同项目期刊论文
A new relaxed extragradient-like algorithm for approaching common solutions of generalized mixed equ
The convergence analysis of the projection methods for a system of generalized relaxed cocoercive va
Numerical study of the nonlinear combined sine-cosine -Gordon equation with the lattice Boltzmann me
The inversion-free iterative methods for solving the nonlinear matrix equation X+A*X^{-1}A+B*X^{-1}B
A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P (0)-funct
A SMOOTHING TRUST REGION METHOD FOR NCPS BASED ON THE SMOOTHING GENERALIZED FISCHER-BURMEISTER FUNCT
期刊信息
位置：