<span id="fpn9h"><noframes id="fpn9h"><span id="fpn9h"></span>
<span id="fpn9h"><noframes id="fpn9h">
<th id="fpn9h"></th>
<strike id="fpn9h"><noframes id="fpn9h"><strike id="fpn9h"></strike>
<th id="fpn9h"><noframes id="fpn9h">
<span id="fpn9h"><video id="fpn9h"></video></span>
<ruby id="fpn9h"></ruby>
<strike id="fpn9h"><noframes id="fpn9h"><span id="fpn9h"></span>

RMS算法的收斂性

convergence of RMS Algorithm

  • 摘要: RMS算法是K.S.Chandra等人1982年提出的一種可用于非光滑函數的線搜索優化算法1它具有調用函數次數少,CPU時間短等突出優點。
    本文補充了文獻1中未討論的退化情況,并對RMS算法加以修改,使其理論上趨于完善。本文還論證了在一定條件下RMS算法的收斂性。

     

    Abstract: The RMS algorithm was initiated by K.S.Chandra and M.V.Rao in1. But in1 the possiblity of degeneration was neglected.In our paper,we construct a counterexample showing that degeneration may infer the non-convergence of the algorithm and we make some corrections to the algorithm so that we can prove the convergence of the corrected algorithm.

     

/

返回文章
返回
<span id="fpn9h"><noframes id="fpn9h"><span id="fpn9h"></span>
<span id="fpn9h"><noframes id="fpn9h">
<th id="fpn9h"></th>
<strike id="fpn9h"><noframes id="fpn9h"><strike id="fpn9h"></strike>
<th id="fpn9h"><noframes id="fpn9h">
<span id="fpn9h"><video id="fpn9h"></video></span>
<ruby id="fpn9h"></ruby>
<strike id="fpn9h"><noframes id="fpn9h"><span id="fpn9h"></span>
www.77susu.com