运筹学学报
運籌學學報
운주학학보
OR TRANSACTIONS
2005年
4期
44-48
,共5页
运筹学%优化问题%广义梯度投影%算法%非精确搜索
運籌學%優化問題%廣義梯度投影%算法%非精確搜索
운주학%우화문제%엄의제도투영%산법%비정학수색
Operations research%optimization%generalized gradient projection%algorithm%inexact line search
本文对线性约束优化问题提出了一个新的广义梯度投影法,该算法采用了非精确线性搜索,并在每次迭代运算中结合了广义投影矩阵和变尺度方法的思想确定其搜索方向.在通常的假设条件下,证明了该算法的整体收敛性和超线性收敛速度.
本文對線性約束優化問題提齣瞭一箇新的廣義梯度投影法,該算法採用瞭非精確線性搜索,併在每次迭代運算中結閤瞭廣義投影矩陣和變呎度方法的思想確定其搜索方嚮.在通常的假設條件下,證明瞭該算法的整體收斂性和超線性收斂速度.
본문대선성약속우화문제제출료일개신적엄의제도투영법,해산법채용료비정학선성수색,병재매차질대운산중결합료엄의투영구진화변척도방법적사상학정기수색방향.재통상적가설조건하,증명료해산법적정체수렴성화초선성수렴속도.
In this paper, a new generalized gradient projection method with inexact line search is proposed for the nonlinear optimization problem with linear constraints. The main idea is to use the generalized projection matrix combined with the variable metric method to determine the search direction at each iteration. Under some suitable assumption it is proved that our method is of global convergence properties and superlinear convergence rate.