Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

The Comparison of Unconstrained Optimization Algorithms and Their Extreme Point Study

MAO Wei;LAN Hengyou;Institude of Nonlinear Science and Engineering Computing,Sichuan University of Science & Engineering;Enterprise Informatization and Network Measurement and Control Technology Sichuan Provincial Key Laboratory of University,Sichuan University of Science & Engineering;  
Solving unconstrained optimization problems is an important research problem in numerical calculations. At present,there are many ways to solve the unconstrained optimization problem,so choosing a rapid method that with small complexity is significant. Firstly,the basic ideas and concrete steps of seven algorithms in unconstrained optimization problems are introduced. Then combined with the MATLAB software programming simulation,according to the quantitative analysis,the simulation results are contrasted and analyzed. Finally,the advantages and disadvantages,the convergence situations of extreme points of seven algorithms are contrasted and studied,and a relatively efficient algorithm is determined according to the convergence iterations and the accuracy of numerical computing results.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved