Abstract
Abstract In comparative studies of constrained optimization methods the equality contrained recursive quadratic programming procedure has performed very favorably, particularly in terms of required computer time for execution. Biggs has formulated a strategy based on a quadratic penalty function and proved the global convergence of the method. This paper reformulates the procedure based on a Lagrangian penalty function leading to improved performance and reduced sensitivity to the algorithm parameters. The formulation and algorithm are described herein and global convergence is demonstrated. Evaluation results on several test problems are presented to allow comparisons with other algorithms of the same type.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
