非凸非精确线搜索时Broyden算法的收敛性
비철비정학선수색시Broyden산법적수렴성
The convergence of Broyden algorithms without convexity and exact line search
  • 万方数据
    运筹学学报 운주학학보
    OR TRANSACTIONS
    2012年 3期 100-108 ,共9页

    濮定国%尚有林%冯爱芬%孙振洋

    복정국%상유림%풍애분%손진양

    Broyden算法%收敛性%凸性%精确线搜索 Broyden算法%收斂性%凸性%精確線搜索
    Broyden산법%수렴성%철성%정학선수색
    Broyden algorithms%convergence%convexity%exact line search
    讨论在非凸非精确线搜索时,Broyden算法的的收敛性.证明当Broyden算法得到的点列收敛时,该点列一定趋向于稳定点.
    토론재비철비정학선수색시,Broyden산법적적수렴성.증명당Broyden산법득도적점렬수렴시,해점렬일정추향우은정점.
    In this paper we discuss the convergence of the Broyden algorithms without convexity and exact line search assumptions. We prove that if the algorithm produces a convergence point sequence,then the limit point of the sequence is a critical point of the objective function.Q-integral graphs.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문