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


On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
Authors:BIGGS  M C
Institution: Numerical Optimisation Centre, Hatfield Polytechnic Hatfield, Hertfordshire
Abstract:This paper considers the convergence of the method of recursiveequality quadratic programming (REQP) for constrained minimization.A theorem of Wolfe (1969) gives conditions on the search directionsand step lengths used by a minimization algorithm which ensurethat it will locate an unconstrained stationary point of a function.It is shown here that, under suitable circumstances, the iterationsof REQP satisfy these conditions both with respect to the conventionalpenalty function P(x, r) and also with respect to the augmentedpenalty function proposed by Fletcher (1969) which has a minimumat the solution to the constrained problem. The behaviour ofREQP in the neighbourhood of the solution is also considered,and it is shown that the algorithm is capable of superlinearconvergence.
Keywords:
本文献已被 Oxford 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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