科研之友
微信
新浪微博
Facebook
分享链接
摘要
A new method of moving asymptotes for large scale minimization subject to linear inequality constraints is discussed in this paper. In each step of the iterative process, a descend direction is obtained by solving a convex separable subproblem with dual technique. The new rules for controlling the asymptotes parameters are designed by the trust region radius and some approximation properties such that the global convergence of the new method are obtained. The numerical results show that the new method may be capable of processing some large scale problems.
- 出版日期2010-2
- 单位南京航空航天大学; 中国矿业大学（北京）
