Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Shanghai Jiaotong University》 1991-02
Add to Favorite Get Latest Update

Improvement and Speed Analysis Of Convergence on Huarde Algorithm for Constrained Optinizasion

Zhang Kebang Huang Bing Zhong Shen Nanpeng  
constrained optimization problem is a kind of widely-applel prob-lom.There are many algorithms for solving it.Such algorithms have theirown advantages and disadvantages,and so does the“method of centers”that P.Huard has proposed in Reference[1].Since the distance functiongiven in Reference[1]is riot ideal,the iterative convergence speed is com-paratively slow.In Reference[2],a new distance is constructed.The con-vergence of the algorithm is discussed in this paper and the convergencespeed is faster than that of Huard's Algorithm.Not only is Reference[2]revisad theoretically and the convergence speed of the algorithm discusse toprove why the“method of centers”has a slow convergence speed but alsothe algorithm is improved it.The authors have constructed a set of distancefunctions which can develop the convergence speed,greatey Finally,someexam-ples have been computed for comparison.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved