首页 | 本学科首页   官方微博 | 高级检索  
     


ODE versus SQP methods for constrained optimization
Authors:A. A. Brown  M. C. Bartholomew-Biggs
Affiliation:(1) Numerical Algorithms Group, Oxford, England;(2) School of Information Science, Hatfield Polytechnic, Hatfield, England
Abstract:In this paper, we review some methods which are designed to solve equality constrained minimization problems by following the trajectory defined by a system of ordinary differential equations. The numerical performance of a number of these methods is compared with that of some popular sequential quadratic programming algorithms. On a set of eighteen difficult test problems, we observe that several of the ODE methods are more successful than any of the SQP techniques. We suggest that these experimental results indicate the need for research both to analyze and develop new ODE techniques and also to strengthen the currently available SQP algorithms.This work was supported by a SERC Research Studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd., the collaborating establishment, for their advice and encouragement.
Keywords:Constrained optimization  trajectory following methods  highly nonlinear problems  computational algorithms
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号